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   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. Volume 100 . 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   bibtex   abstract   buy
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   bibtex   abstract
On modeling multi-experts multi-criteria decision-making argumentation and disagreement: Philosophical and computational approaches reconsidered. Garbayo, L.; Ceberio, M.; Bistarelli, S.; and Henderson, J. Volume 100 . 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   bibtex   abstract   buy
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   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   bibtex   abstract
From Argumentation Frameworks to Voting Systems and Back. Benedetti, I.; and Bistarelli, S. FUNDAMENTA INFORMATICAE, 150: 25–48. 2017.
doi   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   bibtex   abstract
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   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   bibtex   abstract
An end-to-end voting-system based on Bitcoin. Bistarelli, S.; Mantilacci, M.; Santancini, P.; and Santini, F. 2017.
doi   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   bibtex   abstract
Preface of the 1st Workshop on Advances In Argumentation In Artificial Intelligence, AI^3 2017. Bistarelli, S.; Giacomin, M.; and Pazienza, A. Volume 2012 . CEUR-WS, 2017.
Preface of the 1st Workshop on Advances In Argumentation In Artificial Intelligence, AI^3 2017 [link]Paper   bibtex   buy
A community payment scheme for consciousness energy usage. Bistarelli, S.; Giuliodori, P.; and Mugnai, D. 2017.
doi   bibtex
  2016 (9)
Theoretical Computer Science in Italy. Bistarelli, S.; and Formisano, A. 2016.
Theoretical Computer Science in Italy [link]Paper   doi   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   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   bibtex   abstract
Automated adaptation via Quantitative Partial Model Checking. Bistarelli, S.; Santini, F.; Martinelli, F.; and Matteucci, I. 2016.
doi   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   bibtex   abstract
A collective defence against grouped attacks for weighted abstract argumentation frameworks. Bistarelli, S.; Rossi, F.; and Santini, F. 2016.
bibtex   abstract
ConArg: A Tool for Classical and Weighted Argumentation. Bistarelli, S.; Rossi, F.; and Santini, F. 2016.
doi   bibtex   abstract
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   bibtex
Preface. Bistarelli, S.; Formisano, A.; and Maratea, M. Volume 1745 . CEUR-WS, 2016.
Preface [link]Paper   bibtex   buy
  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   bibtex   abstract
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   bibtex   abstract
Towards visualising security with arguments. Bistarelli, S.; Rossi, F.; Santini, F.; and Taticchi, C. 2015.
Towards visualising security with arguments [pdf]Paper   bibtex   abstract
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   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   bibtex   abstract
  2014 (11)
On Relating Voting Systems and Argumentation Frameworks. Benedetti, I.; Bistarelli, S.; and Piersanti, P. 2014.
bibtex   abstract
An Improved Role-Based Access to Android Applications with JCHR. Bistarelli, S.; Costantino, G.; Martinelli, F.; and Santini, F. 2014.
doi   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   bibtex
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   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   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   bibtex   abstract
Efficient Solution for Credulous/Sceptical Acceptance in Lower-Order Dung's Semantics. Bistarelli, S.; Rossi, F.; and Santini, F. 2014.
doi   bibtex   abstract
Two trust networks in one: Using bipolar structures to fuse trust and distrust. Bistarelli, S.; and Santini, F. 2014.
doi   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   bibtex
Enumerating Extensions on Random Abstract-AFs with ArgTools, Aspartix, ConArg2, and Dung-O-Matic. Bistarelli, S.; Rossi, F.; and Santini, F. 2014.
doi   bibtex
Preface. Bistarelli, S.; and Formisano, A. Volume 1231 . pages i–v. CEUR-WS.org, 2014.
Preface [pdf]Paper   bibtex   buy
  2013 (6)
Multi-Experts Multi-Criteria Decision Making. Henderson, J.; Bistarelli, S.; and Ceberio, M. 2013.
doi   bibtex   1 download
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   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.
bibtex
Coalitions of Arguments: An Approach with Constraint Programming. Bistarelli, S.; and Santini, F. FUNDAMENTA INFORMATICAE, 124: 383–401. 2013.
doi   bibtex   abstract
A First Comparison of Abstract Argumentation Systems: A Computational Perspective. Bistarelli, S.; Rossi, F.; and Santini, F. 2013.
bibtex
Solving Fuzzy Distributed CSPs: An Approach with Naming Games. Bistarelli, S.; Gosti, G.; and Santini, F. 2013.
doi   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   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   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   bibtex   abstract
Negotiation on mobile devices using Weighted RTML Credentials. Bistarelli, S.; Martinelli, F.; Roperti, F.; and Santini, F. pages 429–438. Springer, 2012.
doi   bibtex   abstract   buy
Modeling and Solving AFs with a Constraint-Based Tool: ConArg. Bistarelli, S.; and Santini, F. 2012.
doi   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.
bibtex
A Secure Coordination of Agents with Nonmonotonic Soft Concurrent Constraint Programming. Bistarelli, S.; Paola, C.; and Santini, F. 2012.
doi   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.
bibtex
ConArg: Argumentation with Constraints. Bistarelli, S.; and Santini, F. 2012.
bibtex
Towards a similarity-based web service discovery through soft constraint satisfaction problems. Arbab, F.; Santini, F.; Bistarelli, S.; and Pirolandi, D. 2012.
doi   bibtex   abstract   3 downloads
Securely Accessing Shared Resources with Concurrent Constraint Programming. Bistarelli, S.; and Santini, F. 2012.
doi   bibtex   abstract
Semiring-based constraint models and frameworks for security-related scenarios. Bistarelli, S.; and Santini, F. 2012.
doi   bibtex   abstract
  2011 (9)
Security Protocol Deployment Risk. Foley, S. N.; Bella, G.; and Bistarelli, S. 2011.
doi   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.
bibtex
Solving Fuzzy DCSPs with Naming Games. Bistarelli, S.; Gosti, G.; and Santini, F. 2011.
doi   bibtex   abstract
Solving Weighted Argumentation Frameworks with Soft Constraints. Bistarelli, S.; Pirolandi, D.; and Santini, F. 2011.
doi   bibtex   abstract
Finding Partitions of Arguments with Dung’s Properties via SCSPs. Bistarelli, S.; Campli, P.; and Santini, F. 2011.
doi   bibtex   abstract
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   bibtex   abstract
ConArg: A Constraint-based Computational Framework for Argumentation Systems. Bistarelli, S.; and Santini, F. 2011.
doi   bibtex   abstract
A Nonmonotonic Soft Concurrent Constraint Language to Model the negotiation Process. Bistarelli, S.; and Santini, F. FUNDAMENTA INFORMATICAE, 111: 257–279. 2011.
doi   bibtex   abstract
Finding Partitions of Arguments with Dung's Properties via SCSPs. Bistarelli, S.; Campli, P.; and Santini, F. 2011.
bibtex   abstract
  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   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   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   bibtex   abstract
A Formal Framework for Trust Policy Negotiation in Autonomic Systems: Abduction with Soft Constraints. Bistarelli, S.; Martinelli, F.; and Santini, F. 2010.
bibtex
Extending Soft Arc Consistency to Non-Invertible Semirings. Bistarelli, S.; Gadducci, F.; Larrosa, J.; Rollon, E.; and Santini, F. 2010.
doi   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.
bibtex
Solving Distributed CSPs Probabilistically. Bistarelli, S.; and Gosti, G. FUNDAMENTA INFORMATICAE, 105: 57–78. 2010.
doi   bibtex   abstract
Finding Partitions of Arguments with Dung’s Properties via SCSPs. Bistarelli, S.; Campli, P.; and Santini, F. 2010.
bibtex
A Common Computational Framework for Semiring-based Argumentation Systems. Bistarelli, S.; and Santini, F. 2010.
doi   bibtex   abstract
Solving Weighted Argumentation Farmeworks with Soft Constraints. Bistarelli, S.; Daniele, P.; and Santini, F. 2010.
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   bibtex
A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation. Bistarelli, S.; and Santini, F. 2009.
doi   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   bibtex   abstract
Soft Constraints for Dependable Service Oriented Architectures. Bistarelli, S.; and Santini, F. 2009.
doi   bibtex   abstract
Fairness as a QoS Measure for Web Services. Bistarelli, S.; and Campli, P. 2009.
doi   bibtex
Proceedings of the 2009 ACM Symposium on Applied Computing - Constraint solving and programming track. Bistarelli, S.; Monfroy, E.; and O'Sullivan, B. 2009.
bibtex   abstract
Solving CSPs with Naming Games. Bistarelli, S.; and Gosti, G. 2009.
doi   bibtex   abstract
Soft Constraints for Quality Aspects in Service Oriented Architectures. Bistarelli, S.; and Santini, F. 2009.
doi   bibtex
C-semiring Frameworks for Minimum Spanning Tree Problems. Bistarelli, S.; and Santini, F. 2009.
doi   bibtex   abstract
From Marriages to Coalitions: A Soft CSP Approach. Bistarelli, S.; Foley, S. N.; O'Sullivan, B.; and Santini, F. 2009.
doi   bibtex   abstract
Capturing Fair Computations on Concurrent Constraint Language. Campli, P.; and Bistarelli, S. 2009.
doi   bibtex
Constraint Based Languages for Biological Reactions. Bottalico, M.; and Bistarelli, S. 2009.
doi   bibtex
  2008 (11)
Retaliation Against Protocol Attacks. Bella, G.; Bistarelli, S.; and Massacci, F. JOURNAL OF INFORMATION ASSURANCE AND SECURITY, 3: 313–325. 2008.
bibtex   abstract
Analyzing security scenarios using Defence Trees and Answer Set Programming. Bistarelli, S.; Peretti, P.; and Trubitsyna, I. 2008.
doi   bibtex   abstract
Semiring-Based Soft Constraints. Bistarelli, S.; and Rossi, F. Volume 5065 . pages 155–173. Springer, 2008.
bibtex   abstract   buy
Proceedings of the 2008 ACM Symposium on Applied Computing - Constraint solving and programming track. Bistarelli, S.; Monfroy, E.; and O'Sullivan, B. 2008.
bibtex   abstract
Timed Soft Concurrent Constraint Programs. Bistarelli, S.; Gabbrielli, M.; Meo, M. C.; and Santini, F. 2008.
doi   bibtex   abstract
SCLP for Trust Propagation in Small-World Networks. Bistarelli, S.; and Santini, F. 2008.
doi   bibtex   abstract
Weighted Datalog and Levels of Trust. Bistarelli, S.; Martinelli, F.; and Santini, F. 2008.
doi   bibtex   abstract
A Semantic Foundation for Trust Management Languages with Weights: An Application to the RT Family. Bistarelli, S.; Martinelli, F.; and Santini, F. 2008.
doi   bibtex   abstract
A Formal and Practical Framework for Constraint-Based Routing. Bistarelli, S.; and Santini, F. 2008.
bibtex
Propagating multitrust within trust networks. Bistarelli, S.; and Santini, F. 2008.
doi   bibtex   abstract
A soft approach to multi-objective optimization. Bistarelli, S.; Gadducci, F.; Larrosa, J.; and Rollon, E. 2008.
bibtex   abstract
  2007 (10)
Soft Constraint Based Pattern Mining. Bistarelli, S.; and Francesco, B. DATA & KNOWLEDGE ENGINEERING, 62: 118–137. 2007.
doi   bibtex   abstract
Modelling Multicast Qos Routing by using Best-Tree Search in AND-OR Graphs and Soft Constraint Logic Programming. Bistarelli, S.; Montanari, U.; Rossi, F.; and Santini, F. 2007.
doi   bibtex   abstract
Augmented Risk Analysis. Bella, G.; Bistarelli, S.; Peretti, P.; and Riccobene, S. 2007.
doi   bibtex   abstract
Proceedings of the 2007 ACM Symposium on Applied Computing - Constraint solving and programming track. Bistarelli, S.; Monfroy, E.; and O'Sullivan, B. 2007.
bibtex   abstract
Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario. Bistarelli, S.; Peretti, P.; and Trubitsyna, I. 2007.
bibtex
Bipolar preference problems: framework, properties and solving techniques. Bistarelli, S.; Pini, M. S.; Rossi, F.; and Venable, K. B. 2007.
bibtex   abstract
An Optimization Approach using Soft Constraints for the Cascade Vulnerability Problem. Servin, C.; Ceberio, M.; Freudenthal, E.; and Bistarelli, S. 2007.
bibtex
Using CP-nets as a guide for countermeasure selection. Bistarelli, S.; Fioravanti, F.; and Peretti, P. 2007.
bibtex
Uncertainty in Bipolar Preference Problems. Bistarelli, S.; Pini, M. S.; Rossi, F.; and Venable, K. B. 2007.
bibtex   abstract
Constraint Symmetry for the Soft CSP. Smith, B. M.; Bistarelli, S.; and O'Sullivan, B. 2007.
bibtex
  2006 (12)
Soft Concurrent Constraint Programming. Bistarelli, S.; Montanari, U.; and Rossi, F. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 7: 563–589. 2006.
doi   bibtex   abstract
Soft Constraints for Security. Bella, G.; Bistarelli, S.; and Foley, S. N. 2006.
doi   bibtex   abstract
An asymmetric fingerprint matching algorithm for Java Card (TM). Bistarelli, S.; Santini, F.; and Vaccarelli, A. PATTERN ANALYSIS AND APPLICATIONS, 9: 359–376. 2006.
doi   bibtex   abstract
Principles of Secure Network Configuration: Towards a Formal Basis for Self-Configuration. Foley, S. N.; Fitzgerald, W.; Bistarelli, S.; O'Sullivan, B.; and O FOGHLU, M. 2006.
doi   bibtex   abstract
Defense trees for economic evaluation of security investments. Bistarelli, S.; Fioravanti, F.; and Peretti, P. 2006.
doi   bibtex
Bipolar preference problems. Bistarelli, S.; Pini, M. S.; Rossi, F.; and Venable, K. B. 2006.
bibtex   abstract
Strategic games on defense trees. Bistarelli, S.; Peretti, P.; and Dall'Aglio, M. 2006.
bibtex
Proceedings of the 2006 ACM Symposium on Applied Computing - Constraint solving and programming track. Bistarelli, S.; Monfroy, E.; and O'Sullivan, B. 2006.
bibtex   abstract
Special Issue: Preferences and Soft Constraints. Bistarelli, S.; and Rossi, F. 2006.
doi   bibtex
Retaliation: Can We Live with Flaws?. Bella, G.; Bistarelli, S.; and Massacci, F. 2006.
bibtex   abstract
Enhancing constraints manipulation in semiring-based formalisms. Bistarelli, S.; and Gadducci, F. 2006.
bibtex   abstract
Extending the Soft Constraint Based Mining Paradigm. Bistarelli, S.; and Bonchi, F. 2006.
bibtex
  2005 (11)
Relating Multiset Rewriting and Process Algebras for Security Protocol Analysis. Bistarelli, S.; Cervesato, I.; Lenzini, G.; and Martinelli, F. JOURNAL OF COMPUTER SECURITY, 13: 3–47. 2005.
bibtex   abstract
Information Assurance for Security Protocols. Giampaolo, B.; and Bistarelli, S. COMPUTERS & SECURITY, 24: 322–333. 2005.
doi   bibtex   abstract
A soft constraint-based approach to the cascade vulnerability problem. Bistarelli, S.; Foley, S. N.; and O'Sullivan, B. JOURNAL OF COMPUTER SECURITY, 13: 699–720. 2005.
bibtex   abstract
Reasoning about Secure Interoperation using Soft Constraints. Bistarelli, S.; Foley, S. N.; and Barry, O. 2005.
doi   bibtex   abstract
A protocol's life after attacks... Bella, G.; and Bistarelli, S. 2005.
doi   bibtex   abstract
Proceedings of the 2005 ACM Symposium on Applied Computing - Constraint solving and programming track. Bistarelli, S.; Monfroy, E.; and O'Sullivan, B. 2005.
bibtex   abstract
MOC via TOC Using a Mobile Agent Framework. Bistarelli, S.; Frassi, S.; and Vaccarelli, A. 2005.
doi   bibtex   abstract
Biometrics to Enhance Smartcard Security. Bella, G.; Bistarelli, S.; and Martinelli, F. 2005.
doi   bibtex   abstract
An Asymmetric Fingerprint Matching Algorithm for Java Card. Bistarelli, S.; Santini, F.; and Vaccarelli, A. 2005.
doi   bibtex   abstract
Interestingness is not a Dichotomy: Introducing Softness in Constrained Pattern Mining. Bistarelli, S.; and Bonchi, F. 2005.
doi   bibtex   abstract
Multilevel Security and Quality of Protection. Foley, S. N.; Bistarelli, S.; Barry, O.; John, H.; and Garret, S. 2005.
doi   bibtex
  2004 (14)
Soft Constraint Programming to Analysing Security Protocol. Bella, G.; and Bistarelli, S. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 4: 545–572. 2004.
doi   bibtex   abstract
Soft Constraint Propagation and Solving in Constraint Handling Rules. Bistarelli, S.; Fruewirth, T.; Marte, M.; and Rossi, F. COMPUTATIONAL INTELLIGENCE, 20: 287–307. 2004.
doi   bibtex   abstract
Modelling and Detecting the Cascade Vulnerabiliy Problem using Soft Constraints. Bistarelli, S.; Foley, S. N.; and O'Sullivan, B. 2004.
doi   bibtex
Symmetry Breaking in Soft CSPs. Bistarelli, S.; Jerome, K.; and Barry, O. 2004.
bibtex   abstract
Abstracting Soft Constraints: Some experimental results on Fuzzy CSPs. Bistarelli, S.; Rossi, F.; and Pilan, I. 2004.
doi   bibtex   abstract
Confidentiality levels and deliberate/indeliberate protocol attacks. Bella, G.; and Bistarelli, S. 2004.
doi   bibtex   abstract
Advancing Assurance for Secure Distributed Communications. Bella, G.; and Bistarelli, S. 2004.
doi   bibtex
Tradeoff Generation using Soft Constraints. Bistarelli, S.; Kelleher, J.; and O'Sullivan, B. 2004.
doi   bibtex   abstract
Encoding Partial Constraint Satisfaction in the Semiring-Based Framework for Soft Constraints. Bistarelli, S.; Freuder, E. C.; and Osullivan, B. 2004.
doi   bibtex
A Theoretical Framework for Tradeoff Generation using Soft Constraints. Bistarelli, S.; and Barry, O. 2004.
bibtex   abstract
Proceedings of the 2004 ACM Symposium on Applied Computing - AI and computational logic and image analysis (AI). Hung, C. C.; Bistarelli, S.; and Rosa, A. 2004.
bibtex
Semirings for Soft Constraint Solving and Programming. Bistarelli, S. Volume 2962 SPRINGER-VERLAG, BERLIN, 2004.
doi   bibtex   abstract   buy
Detecting and Eliminating the Cascade Vulnerability Problem from Multi-level Security Networks using Soft Constraints. Bistarelli, S.; Foley, S. N.; and O'Sullivan, B. 2004.
bibtex
Experimental Evaluation of Interchangeability in Soft CSPs. Bistarelli, S.; Neagu, N.; and Faltings, B. 2004.
doi   bibtex   abstract
  2003 (11)
General Properties and Termination Conditions for Soft Constraint Propagation. Bistarelli, S.; Gennari, R.; and Rossi, F. CONSTRAINTS, 8: 79–97. 2003.
doi   bibtex   abstract
Interchangeability in Soft CSPs. Bistarelli, S.; Faltings, B.; and Neagu, N. 2003.
doi   bibtex   abstract