Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Alessandro Previti"'
Publikováno v:
Artificial Intelligence. 320:103931
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::597b2a24ee0187df0ea150cadd60469e
https://doi.org/10.1016/j.artint.2023.103931
https://doi.org/10.1016/j.artint.2023.103931
Publikováno v:
Logic Programming and Nonmonotonic Reasoning ISBN: 9783031157066
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ffc3d53488d70d5f3629151e96a31ad
https://doi.org/10.1007/978-3-031-15707-3_3
https://doi.org/10.1007/978-3-031-15707-3_3
Autor:
Alessandro Previti, Matti Järvisalo
Publikováno v:
SAC
The backbone of a constraint satisfaction problem consists of those variables that take the same value in all solutions. Algorithms for determining the backbone of propositional formulas, i.e., Boolean satisfiability (SAT) instances, find various rea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db894166d5303bfbf738e1c47a723fda
https://doi.org/10.1145/3167132.3167230
https://doi.org/10.1145/3167132.3167230
Publikováno v:
Constraints. 21:223-250
The problem of enumerating minimal unsatisfiable subsets (MUSes) of an infeasible constraint system is challenging due first to the complexity of computing even a single MUS and second to the potentially intractable number of MUSes an instance may co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07567147ffafcaf39a8af2ac87969498
https://doi.org/10.1007/s10601-015-9183-0
https://doi.org/10.1007/s10601-015-9183-0
Publikováno v:
ICTAI
The concept of backbone variables, i.e., variables that take the same value in all solutions–or, equivalently, never take a specific value–finds various important applications in the context of Boolean satisfiability (SAT), motivating the develop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b695265abbfab6b14064ec3d2402fa40
Answer Set Programming (ASP) is a logic-based knowledge representation framework, supporting---among other reasoning modes---the central task of query answering. In the propositional case, query answering amounts to computing cautious consequences of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0a69ea286613b675bda52fd5b83a9da
Autor:
Alessandro Previti, Joao Marques-Silva
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 27:818-825
Minimal explanations of infeasibility find a wide range of uses. In the Boolean domain, these are referred to as Minimal Unsatisfiable Subsets (MUSes). In some settings, one needs to enumerate MUSes of a Boolean formula. Most often the goal is to enu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd0325fd12f560d5d0a38caab362afbd
https://doi.org/10.1609/aaai.v27i1.8657
https://doi.org/10.1609/aaai.v27i1.8657
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2017 ISBN: 9783319662626
SAT
SAT
Enumeration of minimal correction sets (MCSes) of conjunctive normal form formulas is a central and highly intractable problem in infeasibility analysis of constraint systems. Often complete enumeration of MCSes is impossible due to both high computa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8efb333a2bb43cb2f3a7c8bfb8af750f
https://doi.org/10.1007/978-3-319-66263-3_12
https://doi.org/10.1007/978-3-319-66263-3_12
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319449524
CP
CP
Given a Satisfiability Modulo Theories (SMT) formula, a minimum satisfying assignment (MSA) is a partial assignment of minimum size that ensures the formula is satisfied. Minimum satisfying assignments find a number of practical applications that inc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41f82ba014a017a19620ec64d7dc8093
https://doi.org/10.1007/978-3-319-44953-1_19
https://doi.org/10.1007/978-3-319-44953-1_19
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2016 ISBN: 9783319409696
SAT
SAT
Given an inconsistent set of constraints, an often studied problem is to compute an irreducible subset of the constraints which, if relaxed, enable the remaining constraints to be consistent. In the case of unsatisfiable propositional formulas in con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f1e91eeb1c6edd61ff400cfc8b7fd6c
https://doi.org/10.1007/978-3-319-40970-2_21
https://doi.org/10.1007/978-3-319-40970-2_21