BibBase bistarelli, s
generated by bibbase.org
  2018 (5)
A novel weighted defence and its relaxation in abstract argumentation. Bistarelli, S.; Rossi, F.; and Santini, F. INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 92: 66–86. 2018.
doi   link   bibtex   abstract   1 download  
. Bistarelli, S.; Ceberio, M.; Henderson, J. A.; and Santini, F. Volume 100 . Abstract argumentation frameworks to promote fairness and rationality in multi-experts multi-criteria decision making, pages 7–19. Springer International Publishing, 2018.
Abstract argumentation frameworks to promote fairness and rationality in multi-experts multi-criteria decision making [link]Paper   doi   link   bibtex   abstract  
Visualising bitcoin flows of ransomware: WannaCry one week later. Bistarelli, S.; Parroccini, M.; and Santini, F. 2018.
Visualising bitcoin flows of ransomware: WannaCry one week later [link]Paper   link   bibtex   abstract  
. Garbayo, L.; Ceberio, M.; Bistarelli, S.; and Henderson, J. Volume 100 . On modeling multi-experts multi-criteria decision-making argumentation and disagreement: Philosophical and computational approaches reconsidered, pages 67–75. Springer International Publishing, 2018.
On modeling multi-experts multi-criteria decision-making argumentation and disagreement: Philosophical and computational approaches reconsidered [link]Paper   doi   link   bibtex   abstract  
Not only size, but also shape counts: Argumentation solvers are benchmark-sensitive. Bistarelli, S.; Rossi, F.; and Santini, F. JOURNAL OF LOGIC AND COMPUTATION, 28: 85–117. 2018.
Not only size, but also shape counts: Argumentation solvers are benchmark-sensitive [link]Paper   doi   link   bibtex   abstract  
  2017 (9)
On merging two trust-networks in one with bipolar preferences. Bistarelli, S.; and Santini, F. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 27: 215–233. 2017.
doi   link   bibtex   abstract  
From Argumentation Frameworks to Voting Systems and Back. Benedetti, I.; and Bistarelli, S. FUNDAMENTA INFORMATICAE, 150: 25–48. 2017.
doi   link   bibtex   abstract  
A hasse diagram for weighted sceptical semantics with a unique-status grounded semantics. Bistarelli, S.; and Santini, F. 2017.
A hasse diagram for weighted sceptical semantics with a unique-status grounded semantics [link]Paper   doi   link   bibtex   abstract   1 download  
PrOnto: An Ontology Driven Business Process Mining Tool. Bistarelli, S.; Di Noia, T.; Mongiello, M.; and Nocera, F. 2017.
PrOnto: An Ontology Driven Business Process Mining Tool [link]Paper   doi   link   bibtex  
A formal and run-time framework for the adaptation of local behaviours to match a global property. Bistarelli, S.; Martinelli, F.; Matteucci, I.; and Santini, F. 2017.
A formal and run-time framework for the adaptation of local behaviours to match a global property [link]Paper   doi   link   bibtex   abstract  
An end-to-end voting-system based on Bitcoin. Bistarelli, S.; Mantilacci, M.; Santancini, P.; and Santini, F. 2017.
doi   link   bibtex   abstract  
Go with the -bitcoin- flow, with visual analytics. Bistarelli, S.; and Santini, F. 2017.
Go with the -bitcoin- flow, with visual analytics [link]Paper   doi   link   bibtex   abstract  
. Bistarelli, S.; Giacomin, M.; and Pazienza, A. Volume 2012 . Preface of the 1st Workshop on Advances In Argumentation In Artificial Intelligence, AI^3 2017. CEUR-WS, 2017.
Preface of the 1st Workshop on Advances In Argumentation In Artificial Intelligence, AI^3 2017 [link]Paper   link   bibtex  
A community payment scheme for consciousness energy usage. Bistarelli, S.; Giuliodori, P.; and Mugnai, D. 2017.
doi   link   bibtex  
  2016 (9)
Theoretical Computer Science in Italy. Bistarelli, S.; and Formisano, A. 2016.
Theoretical Computer Science in Italy [link]Paper   doi   link   bibtex  
A mechanism design approach for allocation of commodities. Bistarelli, S.; Culmone, R.; Giuliodori, P.; and Mugnoz, S. 2016.
A mechanism design approach for allocation of commodities [pdf]Paper   link   bibtex   abstract  
RCRA 2016 International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion. Bistarelli, S.; Formisano, A.; and Maratea, M. 2016.
RCRA 2016 International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion [link]Paper   link   bibtex   abstract  
Automated adaptation via Quantitative Partial Model Checking. Bistarelli, S.; Santini, F.; Martinelli, F.; and Matteucci, I. 2016.
doi   link   bibtex   abstract  
A relaxation of internal conflict and defence in weighted argumentation frameworks. Bistarelli, S.; Rossi, F.; and Santini, F. 2016.
A relaxation of internal conflict and defence in weighted argumentation frameworks [link]Paper   doi   link   bibtex   abstract  
A collective defence against grouped attacks for weighted abstract argumentation frameworks. Bistarelli, S.; Rossi, F.; and Santini, F. 2016.
link   bibtex   abstract  
ConArg: A Tool for Classical and Weighted Argumentation. Bistarelli, S.; Rossi, F.; and Santini, F. 2016.
doi   link   bibtex   abstract   6 downloads  
Special issue of the 22nd RCRA international workshop on "Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion". Bistarelli, S.; Formisano, A.; Maratea, M.; and Torroni, P. 2016.
Special issue of the 22nd RCRA international workshop on "Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion" [link]Paper   doi   link   bibtex  
. Bistarelli, S.; Formisano, A.; and Maratea, M. Volume 1745 . Preface. CEUR-WS, 2016.
Preface [link]Paper   link   bibtex  
  2015 (5)
Timed soft concurrent constraint programs: An interleaved and a parallel approach. Bistarelli, S.; Gabbrielli, M.; Meo, M. C.; and Santini, F. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 15: 1–743. 2015.
doi   link   bibtex   abstract   2 downloads  
A Comparative Test on the Enumeration of Extensions in Abstract Argumentation. Bistarelli, S.; Rossi, F.; and Santini, F. FUNDAMENTA INFORMATICAE, 140: 263–278. 2015.
doi   link   bibtex   abstract  
Towards visualising security with arguments. Bistarelli, S.; Rossi, F.; Santini, F.; and Taticchi, C. 2015.
Towards visualising security with arguments [pdf]Paper   link   bibtex   abstract   1 download  
RCRA 2015 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion. Bistarelli, S.; Formisano, A.; and Maratea, M. 2015.
RCRA 2015 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion [pdf]Paper   link   bibtex  
Testing Credulous and Sceptical Acceptance in Small-World Networks. Bistarelli, S.; Rossi, F.; and Santini, F. 2015.
Testing Credulous and Sceptical Acceptance in Small-World Networks [pdf]Paper   link   bibtex   abstract  
  2014 (11)
On Relating Voting Systems and Argumentation Frameworks. Benedetti, I.; Bistarelli, S.; and Piersanti, P. 2014.
link   bibtex   abstract  
An Improved Role-Based Access to Android Applications with JCHR. Bistarelli, S.; Costantino, G.; Martinelli, F.; and Santini, F. 2014.
doi   link   bibtex   abstract  
Abstract argumentation frameworks to promote fairness and rationality in multi-experts multi-criteria decision making. Bistarelli, S.; Ceberio, M.; Henderson, J. A.; and Santini, F. 2014.
Abstract argumentation frameworks to promote fairness and rationality in multi-experts multi-criteria decision making [pdf]Paper   link   bibtex   1 download  
A Secure Non-monotonic Soft Concurrent Constraint Language. Bistarelli, S.; and Santini, F. FUNDAMENTA INFORMATICAE, 134: 261–285. 2014.
A Secure Non-monotonic Soft Concurrent Constraint Language [link]Paper   doi   link   bibtex   abstract  
Benchmarking Hard Problems in Random Abstract AFs: The Stable Semantics. Bistarelli, S.; Rossi, F.; and Santini, F. 2014.
Benchmarking Hard Problems in Random Abstract AFs: The Stable Semantics [link]Paper   doi   link   bibtex   abstract  
A First Comparison of Abstract Argumentation Reasoning-Tools. Bistarelli, S.; Rossi, F.; and Santini, F. 2014.
A First Comparison of Abstract Argumentation Reasoning-Tools [link]Paper   doi   link   bibtex   abstract   2 downloads  
Efficient Solution for Credulous/Sceptical Acceptance in Lower-Order Dung's Semantics. Bistarelli, S.; Rossi, F.; and Santini, F. 2014.
doi   link   bibtex   abstract  
Two trust networks in one: Using bipolar structures to fuse trust and distrust. Bistarelli, S.; and Santini, F. 2014.
doi   link   bibtex   abstract  
Proceedings of the 15th Italian Conference on Theoretical Computer Science, ICTCS2014. Bistarelli, S.; and Formisano, A. 2014.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, ICTCS2014 [link]Paper   link   bibtex  
Enumerating Extensions on Random Abstract-AFs with ArgTools, Aspartix, ConArg2, and Dung-O-Matic. Bistarelli, S.; Rossi, F.; and Santini, F. 2014.
doi   link   bibtex  
. Bistarelli, S.; and Formisano, A. Volume 1231 . Preface, pages i–v. CEUR-WS.org, 2014.
Preface [pdf]Paper   link   bibtex  
  2013 (6)
Multi-Experts Multi-Criteria Decision Making. Henderson, J.; Bistarelli, S.; and Ceberio, M. 2013.
doi   link   bibtex  
Interchangeability with thresholds and degradation factors for Soft CSPs. Bistarelli, S.; Faltings, B.; and Neagu, N. ANNALS OF MATHEMATICS AND OF ARTIFICIAL INTELLIGENCE, 67: 123–163. 2013.
doi   link   bibtex   abstract   2 downloads  
Proceedings of the 2013 ACM Symposium on Applied Computing - Constraint solving and programming track. Bistarelli, S.; Monfroy, E.; and O'Sullivan, B. 2013.
link   bibtex  
Coalitions of Arguments: An Approach with Constraint Programming. Bistarelli, S.; and Santini, F. FUNDAMENTA INFORMATICAE, 124: 383–401. 2013.
doi   link   bibtex   abstract   2 downloads  
A First Comparison of Abstract Argumentation Systems: A Computational Perspective. Bistarelli, S.; Rossi, F.; and Santini, F. 2013.
link   bibtex   1 download  
Solving Fuzzy Distributed CSPs: An Approach with Naming Games. Bistarelli, S.; Gosti, G.; and Santini, F. 2013.
doi   link   bibtex   abstract  
  2012 (12)
A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials. Bistarelli, S.; Martinelli, F.; and Santini, F. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 64: 447–462. 2012.
doi   link   bibtex   abstract  
Local Arc Consistency for Non-Invertible Semirings, with an Application to Multi-Objective Optimization. Bistarelli, S.; Gadducci, F.; Larrosa, J.; Rollon, E.; and Santini, F. EXPERT SYSTEMS WITH APPLICATIONS, 39: 1708–1717. 2012.
doi   link   bibtex   abstract  
Evaluation of complex security scenarios using defense trees and economic indexes. Bistarelli, S.; Fabio, F.; Pamela, P.; and Francesco, S. JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 24: 161–192. 2012.
doi   link   bibtex   abstract  
. Bistarelli, S.; Martinelli, F.; Roperti, F.; and Santini, F. Negotiation on mobile devices using Weighted RTML Credentials, pages 429–438. Springer, 2012.
doi   link   bibtex   abstract  
Modeling and Solving AFs with a Constraint-Based Tool: ConArg. Bistarelli, S.; and Santini, F. 2012.
doi   link   bibtex   abstract  
Proceedings of the 2012 ACM Symposium on Applied Computing - Constraint solving and programming track. Bistarelli, S.; Monfroi, E.; and O'Sullivan, B. 2012.
link   bibtex  
A Secure Coordination of Agents with Nonmonotonic Soft Concurrent Constraint Programming. Bistarelli, S.; Paola, C.; and Santini, F. 2012.
doi   link   bibtex   abstract  
CELIA. Corpus Elettronico delle Lingue dell'Italia Antica. Agostiniani, L.; Bakkum, G. C. L. M.; Bistarelli, S.; Calderini, A.; Massarelli, R.; and Meiser, G. 2012.
link   bibtex  
ConArg: Argumentation with Constraints. Bistarelli, S.; and Santini, F. 2012.
link   bibtex  
Towards a similarity-based web service discovery through soft constraint satisfaction problems. Arbab, F.; Santini, F.; Bistarelli, S.; and Pirolandi, D. 2012.
doi   link   bibtex   abstract  
Securely Accessing Shared Resources with Concurrent Constraint Programming. Bistarelli, S.; and Santini, F. 2012.
doi   link   bibtex   abstract  
Semiring-based constraint models and frameworks for security-related scenarios. Bistarelli, S.; and Santini, F. 2012.
doi   link   bibtex   abstract  
  2011 (9)
Security Protocol Deployment Risk. Foley, S. N.; Bella, G.; and Bistarelli, S. 2011.
doi   link   bibtex   abstract  
Proceedings of the 2011 ACM Symposium on Applied Computing - Constraint solving and programming track. Bistarelli, S.; Monfroy, E.; and O'Sullivan, B. 2011.
link   bibtex  
Solving Fuzzy DCSPs with Naming Games. Bistarelli, S.; Gosti, G.; and Santini, F. 2011.
doi   link   bibtex   abstract  
Solving Weighted Argumentation Frameworks with Soft Constraints. Bistarelli, S.; Pirolandi, D.; and Santini, F. 2011.
doi   link   bibtex   abstract  
Finding Partitions of Arguments with Dung’s Properties via SCSPs. Bistarelli, S.; Campli, P.; and Santini, F. 2011.
doi   link   bibtex   abstract   1 download  
Uncertainty in Bipolar Preference Problems. Bistarelli, S.; Pini, M. S.; Rossi, F.; and Venable, K. B. JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 23: 545–575. 2011.
doi   link   bibtex   abstract  
ConArg: A Constraint-based Computational Framework for Argumentation Systems. Bistarelli, S.; and Santini, F. 2011.
doi   link   bibtex   abstract   9 downloads  
A Nonmonotonic Soft Concurrent Constraint Language to Model the negotiation Process. Bistarelli, S.; and Santini, F. FUNDAMENTA INFORMATICAE, 111: 257–279. 2011.
doi   link   bibtex   abstract  
Finding Partitions of Arguments with Dung's Properties via SCSPs. Bistarelli, S.; Campli, P.; and Santini, F. 2011.
link   bibtex   abstract   1 download  
  2010 (10)
Unicast and Multicast QoS Routing with Soft Constraint Logic Programming. Bistarelli, S.; Montanari, U.; Rossi, F.; and Santini, F. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 12. 2010.
doi   link   bibtex   abstract  
From soft constraints to bipolar preferences: modelling framework and solving issues. Bistarelli, S.; Pini, M. S.; Rossi, F.; and Venable, K. B. JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 22: 135–158. 2010.
doi   link   bibtex   abstract  
Semiring-based Frameworks for Trust Propagation in Small-World Networks and Coalition Formation Criteria. Bistarelli, S.; Foley, S. N.; O'Sullivan, B.; and Santini, F. SECURITY AND COMMUNICATION NETWORKS, 3: 595–610. 2010.
doi   link   bibtex   abstract  
A Formal Framework for Trust Policy Negotiation in Autonomic Systems: Abduction with Soft Constraints. Bistarelli, S.; Martinelli, F.; and Santini, F. 2010.
link   bibtex  
Extending Soft Arc Consistency to Non-Invertible Semirings. Bistarelli, S.; Gadducci, F.; Larrosa, J.; Rollon, E.; and Santini, F. 2010.
doi   link   bibtex   abstract  
Proceedings of the 2010 ACM Symposium on Applied Computing - Constraint solving and programming track. Bistarelli, S.; Monfroy, E.; and O'Sullivan, B. 2010.
link   bibtex  
Solving Distributed CSPs Probabilistically. Bistarelli, S.; and Gosti, G. FUNDAMENTA INFORMATICAE, 105: 57–78. 2010.
doi   link   bibtex   abstract  
Finding Partitions of Arguments with Dung’s Properties via SCSPs. Bistarelli, S.; Campli, P.; and Santini, F. 2010.
link   bibtex  
A Common Computational Framework for Semiring-based Argumentation Systems. Bistarelli, S.; and Santini, F. 2010.
doi   link   bibtex   abstract  
Solving Weighted Argumentation Farmeworks with Soft Constraints. Bistarelli, S.; Daniele, P.; and Santini, F. 2010.
link   bibtex  
  2009 (12)
Implementing and Testing a Formal Framework for Constraint-Based Routing over Scale-free Networks. Bistarelli, S.; and Santini, F. INTERNATIONAL JOURNAL ON ADVANCES IN NETWORKS AND SERVICES, 2: 13–24. 2009.
Implementing and Testing a Formal Framework for Constraint-Based Routing over Scale-free Networks [link]Paper   link   bibtex  
A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation. Bistarelli, S.; and Santini, F. 2009.
doi   link   bibtex   abstract  
Solving finite domain constraint hierarchies by local consistency and tree search. Bistarelli, S.; Codognet, P.; Hui, H. K. C.; and Lee, J. H. M. JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 21: 233–257. 2009.
doi   link   bibtex   abstract  
Soft Constraints for Dependable Service Oriented Architectures. Bistarelli, S.; and Santini, F. 2009.
doi   link   bibtex   abstract  
Fairness as a QoS Measure for Web Services. Bistarelli, S.; and Campli, P. 2009.
doi   link   bibtex  
Proceedings of the 2009 ACM Symposium on Applied Computing - Constraint solving and programming track. Bistarelli, S.; Monfroy, E.; and O'Sullivan, B. 2009.
link   bibtex   abstract  
Solving CSPs with Naming Games. Bistarelli, S.; and Gosti, G. 2009.
doi   link   bibtex   abstract  
Soft Constraints for Quality Aspects in Service Oriented Architectures. Bistarelli, S.; and Santini, F. 2009.
doi   link   bibtex  
C-semiring Frameworks for Minimum Spanning Tree Problems. Bistarelli, S.; and Santini, F. 2009.
doi   link   bibtex   abstract  
From Marriages to Coalitions: A Soft CSP Approach. Bistarelli, S.; Foley, S. N.; O'Sullivan, B.; and Santini, F. 2009.
doi   link   bibtex   abstract  
Capturing Fair Computations on Concurrent Constraint Language. Campli, P.; and Bistarelli, S. 2009.
doi   link   bibtex  
Constraint Based Languages for Biological Reactions. Bottalico, M.; and Bistarelli, S. 2009.
doi   link   bibtex  
  2008 (11)
Retaliation Against Protocol Attacks. Bella, G.; Bistarelli, S.; and Massacci, F. JOURNAL OF INFORMATION ASSURANCE AND SECURITY, 3: 313–325. 2008.
link   bibtex   abstract  
Analyzing security scenarios using Defence Trees and Answer Set Programming. Bistarelli, S.; Peretti, P.; and Trubitsyna, I. 2008.
doi   link   bibtex   abstract  
. Bistarelli, S.; and Rossi, F. Volume 5065 . Semiring-Based Soft Constraints, pages 155–173. Springer, 2008.
link   bibtex   abstract  
Proceedings of the 2008 ACM Symposium on Applied Computing - Constraint solving and programming track. Bistarelli, S.; Monfroy, E.; and O'Sullivan, B. 2008.
link   bibtex   abstract  
Timed Soft Concurrent Constraint Programs. Bistarelli, S.; Gabbrielli, M.; Meo, M. C.; and Santini, F. 2008.
doi   link   bibtex   abstract  
SCLP for Trust Propagation in Small-World Networks. Bistarelli, S.; and Santini, F. 2008.
doi   link   bibtex   abstract  
Weighted Datalog and Levels of Trust. Bistarelli, S.; Martinelli, F.; and Santini, F. 2008.
doi   link   bibtex   abstract