default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Santini 0001
Person information
- affiliation: University of Perugia, Italy
- affiliation (former): D'Annunzio University of Chieti-Pescara, Pescara, Italy
Other persons with the same name
- Francesco Santini 0002
![[0000-0001-6984-4816]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-6984-4816")
— University of Basel Hospital, Switzerland
SPARQL queries 
🛈 Please note that only 73% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j30]Stefano Bistarelli, Andrea Imparato, Francesco Santini:
A TCP-based covert channel with integrity check and retransmission. Int. J. Inf. Sec. 23(6): 3481-3512 (2024)- [j29]Marco Baioletti, Francesco Santini:
An encoding of argumentation problems using quadratic unconstrained binary optimization. Quantum Mach. Intell. 6(2): 51 (2024) - [c119]Stefano Bistarelli, Francesco Santini, Luca Maria Tutino:
A Short Survey on Bitcoin Price Prediction. DLT 2024 - [c118]Stefano Bistarelli, Gianlorenzo Giuliani, Ivan Mercanti, Francesco Santini:
An In-depth Analysis of Mining Pools Revenue. DLT 2024 - [c117]Stefano Bistarelli, Chiara Luchini, Francesco Santini:
Policy-based Credential Disclosure in SSI by Using ORCON-based Access Control. DLT 2024 - [c116]Stefano Bistarelli, Francesco Santini:
Local Spaces in Soft Concurrent Constraint Programming Oriented to Security. ISoLA (1) 2024: 373-391 - [c115]Stefano Bistarelli, Michele Ceccarelli, Chiara Luchini, Ivan Mercanti, Francesco Santini:
A Preliminary Study on the Creation of a Covert Channel with HTTP Headers. ITASEC 2024 - [i7]Marco Baioletti, Francesco Santini:
An encoding of argumentation problems using quadratic unconstrained binary optimization. CoRR abs/2409.05524 (2024) - 2023
- [c114]Stefano Bistarelli, Michele Ceccarelli, Chiara Luchini, Ivan Mercanti, Francesco Santini:
A Survey of Steganography Tools at Layers 2-4 and HTTP. ARES 2023: 81:1-81:9 - [c113]Marco Baioletti, Francesco Santini:
On using QUBO to enforce extensions in abstract argumentation (Short Paper). AIQxQIA@AI*IA 2023 - [c112]Stefano Bistarelli, Victor David, Francesco Santini, Carlo Taticchi:
Temporal Probabilistic Argumentation Frameworks. CILC 2023 - [c111]Stefano Bistarelli, Ivan Mercanti, Francesco Santini:
Enforcing Confidentiality in Tornado Cash-based E-voting Systems. DLT 2023 - [c110]Stefano Bistarelli, Victor David, Francesco Santini, Carlo Taticchi:
Towards a Temporal Probabilistic Argumentation Framework. FLAIRS 2023 - [c109]Stefano Bistarelli, Francesco Micheli, Francesco Santini:
A Survey on Decentralized Identifier Methods for Self Sovereign Identity. ITASEC 2023 - [c108]Stefano Bistarelli, Andrea Imparato, Francesco Santini:
A TCP-based Covert Channel with Integrity Check and Retransmission. PST 2023: 1-7 - 2022
- [j28]Fabio Gadducci, Francesco Santini:
Distributivity and residuation for lexicographic orders. Inf. Process. Lett. 177: 106271 (2022) - [c107]Stefano Bistarelli, Victor David, Francesco Santini, Carlo Taticchi:
Computing Grounded Semantics of Uncontroversial Acyclic Constellation Probabilistic Argumentation in Linear Time. AI³@AI*IA 2022 - [c106]Stefano Bistarelli, Alessio Mancinelli, Francesco Santini, Carlo Taticchi:
An Argumentative Explanation of Machine Learning Outcomes. COMMA 2022: 347-348 - [c105]Laura Bussi, Fabio Gadducci, Francesco Santini:
Soft Concurrent Constraint Programming with Local Variables. COORDINATION 2022: 159-177 - [c104]Stefano Bistarelli, Bruno Lazo La Torre Montalvo, Ivan Mercanti, Francesco Santini:
An E-Voting System Based on Tornado Cash. ETAA 2022: 120-135 - [c103]Stefano Bistarelli, Alessio Mancinelli, Francesco Santini, Carlo Taticchi:
Arg-XAI: a Tool for Explaining Machine Learning Results. ICTAI 2022: 205-212 - [c102]Stefano Bistarelli, Emanuele Bosimini, Francesco Santini:
On Identifying Repeated Patterns of OT Attacks with LOGistICS. ITASEC 2022: 17-29 - [c101]Stefano Bistarelli, Francesco Santini:
A Definition of Sceptical Semantics in the Constellations Approach. LPNMR 2022: 62-74 - [c100]Marco Baioletti, Francesco Santini:
Abstract Argumentation Goes Quantum: An Encoding to QUBO Problems. PRICAI (1) 2022: 46-60 - 2021
- [j27]Stefano Bistarelli, Lars Kotthoff, Francesco Santini, Carlo Taticchi:
Summary Report for the Third International Competition On Computational Models of Argumentation. AI Mag. 42(3): 70-73 (2021) - [j26]Stefano Bistarelli, Francesco Santini:
Weighted Argumentation. FLAP 8(6): 1589-1622 (2021) - [j25]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs. Inf. Process. Lett. 169: 106107 (2021) - [j24]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
ConArgLib: an argumentation library with support to search strategies and parallel search. J. Exp. Theor. Artif. Intell. 33(6): 891-918 (2021) - [j23]Kasper Dokter, Fabio Gadducci, Benjamin Lion, Francesco Santini:
Soft constraint automata with memory. J. Log. Algebraic Methods Program. 118: 100615 (2021) - [c99]Stefano Bistarelli, Emanuele Bosimini, Francesco Santini:
A Medium-Interaction Emulation and Monitoring System for Operational Technology. ARES 2021: 118:1-118:7 - [c98]Stefano Bistarelli, Carlo Taticchi, Francesco Santini:
A Chatbot Extended with Argumentation. AI³@AI*IA 2021 - [c97]Fabio Gadducci, Francesco Santini:
Residuation for Soft Constraints: Lexicographic Orders and Approximation Techniques. JELIA 2021: 162-176 - [c96]Stefano Bistarelli, Ivan Mercanti, Francesco Faloci, Francesco Santini:
Highlighting poor anonymity and security practice in the blockchain of Bitcoin. SAC 2021: 265-272 - [i6]Fabio Gadducci, Francesco Santini:
Residuation for Soft Constraints: Lexicographic Orders and Approximation Techniques. CoRR abs/2103.06741 (2021) - 2020
- [j22]Stefano Bistarelli, Francesco Santini:
Abstract argumentation and (optimal) stable marriage problems. Argument Comput. 11(1-2): 15-40 (2020) - [c95]Stefano Bistarelli, Lars Kotthoff, Francesco Santini, Carlo Taticchi:
A First Overview of ICCMA'19. AI³@AI*IA 2020: 90-102 - [c94]Stefano Bistarelli, Emanuele Bosimini, Francesco Santini:
A Report on the Security of Home Connections with IoT and Docker Honeypots. ITASEC 2020: 60-70 - [c93]Francesco Santini:
Multi-dimensional Stable Matching Problems in Abstract Argumentation. SUM 2020: 251-260 - [e2]Henry Prakken, Stefano Bistarelli, Francesco Santini, Carlo Taticchi:
Computational Models of Argument - Proceedings of COMMA 2020, Perugia, Italy, September 4-11, 2020. Frontiers in Artificial Intelligence and Applications 326, IOS Press 2020, ISBN 978-1-64368-106-1 [contents]
2010 – 2019
- 2019
- [j21]Stefano Bistarelli, Ivan Mercanti, Francesco Santini:
An Analysis of Non-standard Transactions. Frontiers Blockchain 2: 7 (2019) - [j20]Stefano Bistarelli, Francesco Santini, Paolo Torroni:
Special issue of the Knowledge Representation and Reasoning Track, Symposium on Applied Computing (SAC) 2017. Fundam. Informaticae 166(2): 139-140 (2019) - [j19]Stefano Bistarelli, Ivan Mercanti, Paolo Santancini, Francesco Santini:
End-to-End Voting with Non-Permissioned and Permissioned Ledgers. J. Grid Comput. 17(1): 97-118 (2019) - [c92]Francesco Santini:
From Trust Among Agents to Reputation of Abstract Arguments by Using Subjective Logic. AI³@AI*IA 2019: 65-79 - [c91]Stefano Bistarelli, Francesco Santini:
An Introduction to Optimal Stable Marriage Problems and Argumentation Frameworks. AI³@AI*IA 2019: 80-84 - [c90]Filippo Bonchi, Laura Bussi, Fabio Gadducci, Francesco Santini:
Polyadic Soft Constraints. The Art of Modelling Computational Systems 2019: 241-257 - [c89]Stefano Bistarelli, Francesco Faloci, Francesco Santini, Carlo Taticchi:
A Tool For Ranking Arguments Through Voting-Games Power Indexes. CILC 2019: 193-201 - [c88]Stefano Bistarelli, Claudio Pannacci, Francesco Santini:
CapBAC in Hyperledger Sawtooth. DAIS 2019: 152-169 - [c87]Stefano Bistarelli, Francesco Santini:
Well-Foundedness in Weighted Argumentation Frameworks. JELIA 2019: 69-84 - [c86]Ryuta Arisaka, Francesco Santini, Stefano Bistarelli:
Block Argumentation. PRIMA 2019: 618-626 - [e1]Francesco Santini, Alice Toniolo:
Proceedings of the 3rd Workshop on Advances In Argumentation In Artificial Intelligence co-located with the 18th International Conference of the Italian Association for Artificial Intelligence (AI*IA 2019), Rende, Italy, November 19-22, 2019. CEUR Workshop Proceedings 2528, CEUR-WS.org 2019 [contents] - [i5]Ryuta Arisaka, Stefano Bistarelli, Francesco Santini:
Block Argumentation. CoRR abs/1901.06378 (2019) - 2018
- [j18]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
A novel weighted defence and its relaxation in abstract argumentation. Int. J. Approx. Reason. 92: 66-86 (2018) - [j17]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
Not only size, but also shape counts: abstract argumentation solvers are benchmark-sensitive. J. Log. Comput. 28(1): 85-117 (2018) - [c85]Stefano Bistarelli, Theofrastos Mantadelis, Francesco Santini, Carlo Taticchi:
Using MetaProbLog and ConArg to compute Probabilistic Argumentation Frameworks. AI³@AI*IA 2018: 6-10 - [c84]Stefano Bistarelli, Paolo Giuliodori, Francesco Santini, Carlo Taticchi:
A Cooperative-game Approach to Share Acceptability and Rank Arguments. AI³@AI*IA 2018: 86-90 - [c83]Kasper Dokter, Fabio Gadducci, Francesco Santini:
Soft Constraint Automata with Memory. It's All About Coordination 2018: 70-85 - [c82]Stefano Bistarelli, Francesco Santini, Carlo Taticchi:
Local Expansion Invariant Operators in Argumentation Semantics. CLAR 2018: 45-62 - [c81]Stefano Bistarelli, Lars Kotthoff, Francesco Santini, Carlo Taticchi:
Containerisation and Dynamic Frameworks in ICCMA'19. SAFA@COMMA 2018: 4-9 - [c80]Stefano Bistarelli, Francesco Faloci, Francesco Santini, Carlo Taticchi:
Studying Dynamics in Argumentation with Rob. COMMA 2018: 451-452 - [c79]Ivan Mercanti, Stefano Bistarelli, Francesco Santini:
An Analysis of Non-standard Bitcoin Transactions. CVCBT 2018: 93-96 - [c78]Stefano Bistarelli, Ivan Mercanti, Francesco Santini:
A Suite of Tools for the Forensic Analysis of Bitcoin Transactions: Preliminary Report. Euro-Par Workshops 2018: 329-341 - [c77]Stefano Bistarelli, Francesco Santini, Carlo Taticchi:
On Looking for Invariant Operators in Argumentation Semantics. FLAIRS 2018: 537-540 - [c76]Francesco Santini, Audun Jøsang, Maria Silvia Pini:
Are My Arguments Trustworthy? Abstract Argumentation with Subjective Logic. FUSION 2018: 1982-1989 - [c75]Stefano Bistarelli, Theofrastos Mantadelis, Francesco Santini, Carlo Taticchi:
Probabilistic Argumentation Frameworks with MetaProbLog and ConArg. ICTAI 2018: 675-679 - [c74]Stefano Bistarelli, Matteo Parroccini, Francesco Santini:
Visualizing Bitcoin Flows of Ransomware: WannaCry One Week Later. ITASEC 2018 - [c73]Stefano Bistarelli, Francesco Santini:
Some Thoughts On Well-Foundedness in Weighted Abstract Argumentation. KR 2018: 623-624 - [i4]Stefano Bistarelli, Francesco Santini, Carlo Taticchi:
On Looking for Local Expansion Invariants in Argumentation Semantics. CoRR abs/1802.08328 (2018) - 2017
- [j16]Fabio Gadducci, Francesco Santini:
Residuation for bipolar preferences in soft constraints. Inf. Process. Lett. 118: 69-74 (2017) - [j15]Fabio Gadducci, Francesco Santini, Luis Fernando Pino, Frank D. Valencia:
Observational and behavioural equivalences for soft concurrent constraint programming. J. Log. Algebraic Methods Program. 92: 45-63 (2017) - [j14]Stefano Bistarelli, Francesco Santini:
On merging two trust-networks in one with bipolar preferences. Math. Struct. Comput. Sci. 27(2): 215-233 (2017) - [c72]Stefano Bistarelli, Francesco Santini:
Go with the -Bitcoin- Flow, with Visual Analytics. ARES 2017: 38:1-38:6 - [c71]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
A ConArg-based Library for Abstract Argumentation. AI³@AI*IA 2017: 7-21 - [c70]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
A ConArg-Based Library for Abstract Argumentation. ICTAI 2017: 374-381 - [c69]Francesco Santini:
Properties and Implementation of a Two-Step Ranking-Based Semantics: On Revising NaE and SC. ICTAI 2017: 1174-1181 - [c68]Stefano Bistarelli, Fabio Martinelli, Ilaria Matteucci, Francesco Santini:
A Quantitative Partial Model-Checking Function and Its Optimisation. LPAR 2017: 319-337 - [c67]Stefano Bistarelli, Francesco Santini:
A Hasse Diagram for Weighted Sceptical Semantics with a Unique-Status Grounded Semantics. LPNMR 2017: 49-56 - [c66]Stefano Bistarelli, Marco Mantilacci, Paolo Santancini, Francesco Santini:
An end-to-end voting-system based on bitcoin. SAC 2017: 1836-1841 - 2016
- [c65]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
ConArg: A Tool for Classical and Weighted Argumentation. COMMA 2016: 463-464 - [c64]Ilaria Matteucci, Francesco Santini:
Decomposing Global Quantitative Properties into Local Ones. DPM/QASA@ESORICS 2016: 34-50 - [c63]Stefano Bistarelli, Fabio Martinelli, Ilaria Matteucci, Francesco Santini:
A Formal and Run-Time Framework for the Adaptation of Local Behaviours to Match a Global Property. FACS 2016: 134-152 - [c62]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
A Collective Defence Against Grouped Attacks for Weighted Abstract Argumentation Frameworks. FLAIRS 2016: 638-643 - [c61]Simone Gabbriellini, Francesco Santini:
From Reviews to Arguments and from Arguments Back to Reviewers' Behaviour. ICAART (Revised Selected Papers) 2016: 56-72 - [c60]Simone Gabbriellini, Francesco Santini:
From Arguments and Reviewers to their Simulation - Reproducing a Case-Study. ICAART (1) 2016: 74-83 - [c59]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
A Relaxation of Internal Conflict and Defence in Weighted Argumentation Frameworks. JELIA 2016: 127-143 - [c58]Nicola Nostro, Ilaria Matteucci, Andrea Ceccarelli, Francesco Santini, Felicita Di Giandomenico, Fabio Martinelli, Andrea Bondavalli:
A multi-criteria ranking of security countermeasures. SAC 2016: 530-533 - [c57]Stefano Bistarelli, Francesco Santini, Fabio Martinelli, Ilaria Matteucci:
Automated adaptation via quantitative partial model checking. SAC 2016: 1993-1996 - [c56]Francesco Santini:
Graded Justification of Arguments via Internal and External Endogenous Features. SUM 2016: 352-359 - 2015
- [j13]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
A Comparative Test on the Enumeration of Extensions in Abstract Argumentation. Fundam. Informaticae 140(3-4): 263-278 (2015) - [j12]Sung-Shik T. Q. Jongmans, Francesco Santini, Farhad Arbab:
Partially distributed coordination with Reo and constraint automata. Serv. Oriented Comput. Appl. 9(3-4): 311-339 (2015) - [j11]Stefano Bistarelli, Maurizio Gabbrielli, Maria Chiara Meo, Francesco Santini:
Timed soft concurrent constraint programs: An interleaved and a parallel approach. Theory Pract. Log. Program. 15(6): 743-782 (2015) - [c55]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
Testing Credulous and Sceptical Acceptance in Small-World Networks. RCRA@AI*IA 2015: 39-46 - [c54]Francesco Santini:
Defeasible Logic Programming in Satisfiability Modulo CHR. AI*IA 2015: 191-204 - [c53]Fabio Martinelli, Ilaria Matteucci, Francesco Santini:
There are Two Sides to Every Question - Controller Versus Attacker. Programming Languages with Applications to Biology and Security 2015: 304-318 - [c52]Stefano Bistarelli, Fabio Rossi, Francesco Santini, Carlo Taticchi:
Towards visualising security with arguments. CILC 2015: 197-201 - [c51]Fabio Gadducci, Francesco Santini, Luis Fernando Pino, Frank D. Valencia:
A Labelled Semantics for Soft Concurrent Constraint Programming. COORDINATION 2015: 133-149 - [c50]Francesco Santini, Artsiom Yautsiukhin:
Quantitative Analysis of Network Security with Abstract Argumentation. DPM/QASA@ESORICS 2015: 30-46 - [c49]Simone Gabbriellini, Francesco Santini:
A Micro Study on the Evolution of Arguments in Amazon.com's Reviews. PRIMA 2015: 284-300 - [c48]Fabio Martinelli, Francesco Santini, Artsiom Yautsiukhin:
Network security supported by arguments. PST 2015: 165-172 - [c47]Fabio Martinelli, Ilaria Matteucci, Francesco Santini:
Semiring-based Specification Approaches for Quantitative Security. QAPL 2015: 95-109 - 2014
- [j10]Stefano Bistarelli, Francesco Santini:
A Secure Non-monotonic Soft Concurrent Constraint Language. Fundam. Informaticae 134(3-4): 261-285 (2014) - [j9]Sung-Shik T. Q. Jongmans, Francesco Santini, Mahdi Sargolzaei, Farhad Arbab, Hamideh Afsarmanesh:
Orchestrating web services using Reo: from circuits and behaviors to automatically generated code. Serv. Oriented Comput. Appl. 8(4): 277-297 (2014) - [c46]Stefano Bistarelli, Gianpiero Costantino, Fabio Martinelli, Francesco Santini:
An Improved Role-Based Access to Android Applications with JCHR. ARES 2014: 341-348 - [c45]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
Enumerating Extensions on Random Abstract-AFs with ArgTools, Aspartix, ConArg2, and Dung-O-Matic. CLIMA 2014: 70-86 - [c44]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
Benchmarking Hard Problems in Random Abstract AFs: The Stable Semantics. COMMA 2014: 153-160 - [c43]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
A First Comparison of Abstract Argumentation Reasoning-Tools. ECAI 2014: 969-970 - [c42]Fabio Martinelli, Francesco Santini:
Debating Cybersecurity or Securing a Debate? - (Position Paper). FPS 2014: 239-246 - [c41]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
Efficient Solution for Credulous/Sceptical Acceptance in Lower-Order Dung's Semantics. ICTAI 2014: 800-804 - [c40]Stefano Bistarelli, Martine Ceberio, Joel A. Henderson, Francesco Santini:
Abstract argumentation frameworks to promote fairness and rationality in multi-experts multi-criteria decision making. ICTCS 2014: 247-257 - [c39]Sung-Shik T. Q. Jongmans, Francesco Santini, Farhad Arbab:
Partially-Distributed Coordination with Reo. PDP 2014: 697-706 - [c38]Stefano Bistarelli, Francesco Santini:
Two trust networks in one: Using bipolar structures to fuse trust and distrust. PST 2014: 383-390 - [i3]Stefano Bistarelli, Maurizio Gabbrielli, Maria Chiara Meo, Francesco Santini:
Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel Approach. CoRR abs/1403.0461 (2014) - 2013
- [j8]Stefano Bistarelli, Francesco Santini:
Coalitions of Arguments: An Approach with Constraint Programming. Fundam. Informaticae 124(4): 383-401 (2013) - [c37]Stefano Bistarelli, Fabio Rossi, Francesco Santini:
A First Comparison of Abstract Argumentation Systems: A Computational Perspective. CILC 2013: 241-245 - [c36]Maurice H. ter Beek, Fabio Gadducci, Francesco Santini:
Validating reconfigurations of reo circuits in an e-Banking scenario. ISARCS 2013: 39-48 - [c35]Audun Jøsang, Guibing Guo, Maria Silvia Pini, Francesco Santini, Yue Xu:
Combining Recommender and Reputation Systems to Produce Better Online Advice. MDAI 2013: 126-138 - [c34]Mahdi Sargolzaei, Francesco Santini, Farhad Arbab, Hamideh Afsarmanesh:
A Tool for Behaviour-Based Discovery of Approximately Matching Web Services. SEFM 2013: 152-166 - 2012
- [j7]Stefano Bistarelli, Fabio Martinelli, Francesco Santini:
A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials. Comput. Math. Appl. 64(4): 447-462 (2012) - [j6]Stefano Bistarelli, Fabio Gadducci, Javier Larrosa, Emma Rollon, Francesco Santini:
Local arc consistency for non-invertible semirings, with an application to multi-objective optimization. Expert Syst. Appl. 39(2): 1708-1717 (2012) - [j5]Stefano Bistarelli, Fabio Fioravanti, Pamela Peretti, Francesco Santini:
Evaluation of complex security scenarios using defense trees and economic indexes. J. Exp. Theor. Artif. Intell. 24(2): 161-192 (2012) - [c33]Stefano Bistarelli, Francesco Santini:
ConArg: Argumentation with Constraints. AT 2012: 197-198 - [c32]Stefano Bistarelli, Francesco Santini:
Semiring-based constraint models and frameworks for security-related scenarios. CRiSIS 2012: 1-4 - [c31]Stefano Bistarelli, Giorgio Gosti, Francesco Santini:
Solving Fuzzy Distributed CSPs: An Approach with Naming Games. DALT 2012: 116-135 - [c30]Sung-Shik T. Q. Jongmans, Francesco Santini, Mahdi Sargolzaei, Farhad Arbab, Hamideh Afsarmanesh:
Automatic Code Generation for the Orchestration of Web Services with Reo. ESOCC 2012: 1-16 - [c29]Stefano Bistarelli, Paola Campli, Francesco Santini:
A secure coordination of agents with nonmonotonic soft Concurrent Constraint Programming. SAC 2012: 1551-1553 - [c28]Stefano Bistarelli, Francesco Santini:
Securely Accessing Shared Resources with Concurrent Constraint Programming. SEFM 2012: 308-322 - [c27]Farhad Arbab, Francesco Santini, Stefano Bistarelli, Daniele Pirolandi:
Towards a similarity-based web service discovery through soft constraint satisfaction problems. SSW@VLDB 2012: 2 - [c26]Farhad Arbab, Francesco Santini:
Preference and Similarity-Based Behavioral Discovery of Services. WS-FM 2012: 118-133 - [i2]Stefano Bistarelli, Francesco Santini:
ConArg: a Tool to Solve (Weighted) Abstract Argumentation Frameworks with (Soft) Constraints. CoRR abs/1212.2857 (2012) - 2011
- [j4]Stefano Bistarelli, Francesco Santini:
A Nonmonotonic Soft Concurrent Constraint Language to Model the Negotiation Process. Fundam. Informaticae 111(3): 257-279 (2011) - [c25]Stefano Bistarelli, Paola Campli, Francesco Santini:
Finding Partitions of Arguments with Dung's Properties via SCSPs. CILC 2011: 199-213 - [c24]Stefano Bistarelli, Francesco Santini:
ConArg: A Constraint-Based Computational Framework for Argumentation Systems. ICTAI 2011: 605-612 - [c23]Stefano Bistarelli, Giorgio Gosti, Francesco Santini:
Solving Fuzzy DCSPs with Naming Games. ICTAI 2011: 930-931 - [c22]Stefano Bistarelli, Paola Campli, Francesco Santini:
Finding partitions of arguments with Dung's properties via SCSPs. SAC 2011: 913-919 - [c21]Stefano Bistarelli, Francesco Santini:
Modeling and Solving AFs with a Constraint-Based Tool: ConArg. TAFA 2011: 99-116 - 2010
- [j3]Stefano Bistarelli, Simon N. Foley, Barry O'Sullivan, Francesco Santini:
Semiring-based frameworks for trust propagation in small-world networks and coalition formation criteria. Secur. Commun. Networks 3(6): 595-610 (2010) - [j2]Stefano Bistarelli, Ugo Montanari, Francesca Rossi, Francesco Santini:
Unicast and multicast QoS routing with soft-constraint logic programming. ACM Trans. Comput. Log. 12(1): 5:1-5:48 (2010) - [c20]Stefano Bistarelli, Fabio Martinelli, Francesco Santini:
A Formal Framework for Trust Policy Negotiation in Autonomic Systems: Abduction with Soft Constraints. ATC 2010: 268-282 - [c19]Stefano Bistarelli, Daniele Pirolandi, Francesco Santini:
Solving Weighted Argumentation Frameworks with Soft Constraints. CILC 2010 - [c18]Stefano Bistarelli, Francesco Santini:
A Common Computational Framework for Semiring-based Argumentation Systems. ECAI 2010: 131-136 - [c17]Stefano Bistarelli, Fabio Gadducci, Javier Larrosa, Emma Rollon, Francesco Santini:
Extending Soft Arc Consistency Algorithms to Non-invertible Semirings. MICAI (1) 2010: 386-398
2000 – 2009
- 2009
- [c16]Stefano Bistarelli, Daniele Pirolandi, Francesco Santini:
Solving Weighted Argumentation Frameworks with Soft Constraints. CSCLP 2009: 1-18 - [c15]Stefano Bistarelli, Francesco Santini:
Soft Constraints for Quality Aspects in Service Oriented Architectures. YR-SOC 2009: 51-65 - 2008
- [c14]Stefano Bistarelli, Fabio Martinelli, Francesco Santini:
Weighted Datalog and Levels of Trust. ARES 2008: 1128-1134 - [c13]Francesco Santini:
Managing Quality of Service with Soft Constraints. AAAI 2008: 1869-1870 - [c12]Stefano Bistarelli, Fabio Martinelli, Francesco Santini:
A Semantic Foundation for Trust Management Languages with Weights: An Application to the RTFamily. ATC 2008: 481-495 - [c11]Stefano Bistarelli, Maurizio Gabbrielli, Maria Chiara Meo, Francesco Santini:
Timed Soft Concurrent Constraint Programs. COORDINATION 2008: 50-66 - [c10]Stefano Bistarelli, Simon N. Foley, Barry O'Sullivan, Francesco Santini:
From Marriages to Coalitions: A Soft CSP Approach. CSCLP 2008: 1-15 - [c9]Francesco Santini:
Managing Quality of Service with Soft Constraints. ICLP 2008: 815-817 - [c8]Stefano Bistarelli, Francesco Santini:
A Formal and Practical Framework for Constraint-Based Routing. ICN 2008: 162-167 - [c7]Stefano Bistarelli, Francesco Santini:
Soft Constraints for Dependable Service Oriented Architectures. WADS 2008: 76-97 - [c6]Stefano Bistarelli, Francesco Santini:
Propagating multitrust within trust networks. SAC 2008: 1990-1994 - [c5]Stefano Bistarelli, Francesco Santini:
C-semiring Frameworks for Minimum Spanning Tree Problems. WADT 2008: 56-70 - [c4]Stefano Bistarelli, Francesco Santini:
A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation. VODCA@FOSAD 2008: 147-162 - 2007
- [c3]Stefano Bistarelli, Francesco Santini:
SCLP for Trust Propagation in Small-World Networks. CSCLP 2007: 32-46 - [c2]Stefano Bistarelli, Ugo Montanari, Francesca Rossi, Francesco Santini:
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming. QAPL 2007: 111-127 - [i1]Stefano Bistarelli, Ugo Montanari, Francesca Rossi, Francesco Santini:
Unicast and Multicast Qos Routing with Soft Constraint Logic Programming. CoRR abs/0704.1783 (2007) - 2006
- [j1]Stefano Bistarelli, Francesco Santini, Anna Vaccarelli:
An asymmetric fingerprint matching algorithm for Java Card TM. Pattern Anal. Appl. 9(4): 359-376 (2006) - 2005
- [c1]Stefano Bistarelli, Francesco Santini, Anna Vaccarelli:
An Asymmetric Fingerprint Matching Algorithm for Java Card™. AVBPA 2005: 279-288
Coauthor Index
[j30] [c119] [c118] [c117] [c116] [c115] [c114] [c112] [c111] [c110] [c109] [c108] [c107] [c106] [c104] [c103] [c102] [c101] [j27] [j26] [j25] [j24] [c99] [c98] [c96] [j22] [c95] [c94] [e2] [j21] [j20] [j19] [c91] [c89] [c88] [c87] [c86] [i5] [j18] [j17] [c85] [c84] [c82] [c81] [c80] [c79] [c78] [c77] [c75] [c74] [c73] [i4] [j14] [c72] [c71] [c70] [c68] [c67] [c66] [c65] [c63] [c62] [c59] [c57] [j13] [j11] [c55] [c52] [j10] [c46] [c45] [c44] [c43] [c41] [c40] [c38] [i3] [j8] [c37] [j7] [j6] [j5] [c33] [c32] [c31] [c29] [c28] [c27] [i2] [j4] [c25] [c24] [c23] [c22] [c21] [j3] [j2] [c20] [c19] [c18] [c17] [c16] [c15] [c14] [c12] [c11] [c10] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [i1] [j1] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
