Filters








109 Hits in 4.0 sec

On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels) [chapter]

Enrico Giunchiglia, Marco Maratea
2005 Lecture Notes in Computer Science  
Answer Set Programming (ASP) is a declarative paradigm for solving search problems. State-of-the-art systems for ASP include SMODELS, DLV, CMODELS, and ASSAT.  ...  Given our result and that the CMODELS search engine is based on the Davis Logemann Loveland procedure (DLL) for propositional satisfiability (SAT), we are able to establish that many of the properties  ...  Acknowledgments We would like to thank Nicola Leone, Vladimir Lifschitz and Mirek Truszczynski for discussions related to the subject of this paper. This work has been partially supported by MIUR.  ... 
doi:10.1007/11562931_6 fatcat:szollyu6qjfqri4romtu7vkjt4

On the relation among answer set solvers

Enrico Giunchiglia, Nicola Leone, Marco Maratea
2008 Annals of Mathematics and Artificial Intelligence  
We consider smodels, dlv, and cmodels ASP systems based on stable model semantics, the first two being native ASP systems and the last being a SAT-based system.  ...  In this paper, we study the relation among Answer Set Programming (ASP) systems from a computational point of view.  ...  Acknowledgements We would like to thank Wolfgang Faber, Vladimir Lifschitz, Yuliya Lierler, Fangzhen Lin, Ilkka Niemelä and Mirek Truszczynski for discussions related to the subject of this paper, and  ... 
doi:10.1007/s10472-009-9113-1 fatcat:ho566ul4ojezdimsbtwosrsmqq

Computing Answer Sets of a Logic Program via-enumeration of SAT certificates

Yuliya Lierler, Marco Maratea
2003 Answer Set Programming  
Answer set programming is a new programming paradigm proposed in [1] and [2] , and based on the answer set semantics of Prolog [3] .  ...  Answer set solver CMODELS-1 2 [12] is a system that computes answer sets for logic programs that are tight or can be transformed into tight programs, and does not suffer from these limitations.  ...  Acknowledgments We are grateful to Enrico Giunchiglia and Vladimir Lifschitz for their comments and suggestions related to the subject of this paper.  ... 
dblp:conf/asp/LierlerM03 fatcat:ykegzhompjf47auxrmh5je5f5y

A SAT-based polynomial space algorithm for answer set programming

Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
2004 Non-Monotonic Reasoning  
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during  ...  There are also well known results showing a one-to-one correspondence between the answer sets of a logic program and the models of its completion.  ...  Lifschitz and B. Schiemann for their comments related to the subject of the paper; to E. Erdem and K. Heljanko for providing us with the benchmarks; and to F. Calimeri for his support on DLV.  ... 
dblp:conf/nmr/GiunchigliaLM04 fatcat:wkfduinf3nbuxadnjkeic64moa

Systems, Engineering Environments, and Competitions

Yuliya Lierler, Marco Maratea, Francesco Ricca
2016 The AI Magazine  
Second, we discuss development tools and environments that facilitate the use of answer set programming technology in practical applications.  ...  Last, we present the evolution of the answer set programming competitions, prime venues for tracking advances in answer set solving technology.  ...  "Native" answer set solvers such as Smodels, Smodels cc , and DLV are based on specialized search procedures in the spirit of the classic backtrack-search Davis-Putnam-Logemann-Loveland (DPLL) algorithm  ... 
doi:10.1609/aimag.v37i3.2675 fatcat:huqvzr4nxfdpficyxbnjiknuze

Abstract Answer Set Solvers [chapter]

Yuliya Lierler
2008 Lecture Notes in Computer Science  
We design a similar framework for three algorithms that generate answer sets for logic programs: SMODELS, ASP-SAT with Backtracking, and a newly designed and implemented algorithm SUP.  ...  This approach to describing answer set solvers makes it easier to prove their correctness, to compare them, and to design new systems.  ...  Acknowledgements We are grateful to Marco Maratea for bringing to our attention the work by Nieuwenhuis et al. (2006), to Vladimir Lifschitz for the numerous discussions, to Martin Gebser and Michael Gelfond  ... 
doi:10.1007/978-3-540-89982-2_35 fatcat:hajtlj3hsfakpgwarmavkkwqrm

Answer Set Programming Based on Propositional Satisfiability

Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
2006 Journal of automated reasoning  
From a practical perspective, we have (i) implemented ASP-SAT in Cmodels, (ii) extended the basic procedures in order to incorporate the most popular SAT reasoning strategies, and (iii) conducted an extensive  ...  comparative analysis involving also other state-of-the-art answer set solvers.  ...  Acknowledgements We are grateful to Paolo Ferraris, Nicola Leone, Vladimir Lifschitz and the anonymous reviewers of this paper for their helpful comments and/or discussions on the subject of the paper;  ... 
doi:10.1007/s10817-006-9033-2 fatcat:65qcwxsp5fgknlqtrl6vbfqwoy

What is answer set programming to propositional satisfiability

Yuliya Lierler
2016 Constraints  
Propositional satisfiability (or satisfiability) and answer set programming are two closely related subareas of Artificial Intelligence that are used to model and solve difficult combinatorial search problems  ...  Satisfiability solvers and answer set solvers are the software systems that find satisfying interpretations and answer sets for given propositional formulas and logic programs, respectively.  ...  Acknowledgments We are grateful for discussions with Remi Brochenin, Marc Denecker, Vladimir Lifschitz, Marco Maratea, Cesare Tinelli, Mirek Truszczyński, and Peter Schüller on the topics related to the  ... 
doi:10.1007/s10601-016-9257-7 fatcat:iddfpr576be7lecypoykt3lysu

Abstract Answer Set Solvers with Learning [article]

Yuliya Lierler
2010 arXiv   pre-print
We design a similar framework for several algorithms that generate answer sets for logic programs: Smodels, Smodels-cc, Asp-Sat with Learning (Cmodels), and a newly designed and implemented algorithm Sup  ...  This approach to describing answer set solvers makes it easier to prove their correctness, to compare them, and to design new systems.  ...  , and Miros law Truszczyński for valuable ideas and comments, to anonymous referees for their suggestions.  ... 
arXiv:1001.0820v1 fatcat:pmom4akxlrajxmwoqdvuvverea

Abstract answer set solvers with backjumping and learning

YULIYA LIERLER
2011 Theory and Practice of Logic Programming  
AbstractNieuwenhuiset al. (2006.Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T).  ...  We design a similar framework for several algorithms that generate answer sets for logic programs:smodels,smodelscc,asp-satwith Learning (cmodels), and a newly designed and implemented algorithmsup.  ...  , and Miros law Truszczyński for valuable ideas and comments, to anonymous referees for their suggestions.  ... 
doi:10.1017/s1471068410000578 fatcat:46dwwks3rjhurpzwv7ipl24cc4

An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems

Agostino Dovier, Andrea Formisano, Enrico Pontelli
2009 Journal of experimental and theoretical artificial intelligence (Print)  
This paper presents experimental comparisons between the declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Programming over finite  ...  The objective is to investigate how the solvers in the two domains respond to different problems, highlighting strengths and weaknesses of their implementations and suggesting criteria for choosing one  ...  Acknowledgments We thank Yuliya Lierler, Marco Maratea, Tran Cao Son, and Neng-Fa Zhou for useful discussions on the topics of this paper.  ... 
doi:10.1080/09528130701538174 fatcat:rrqurqkkujet3kln56gg5edaqe

Evaluating Search Strategies and Heuristics for Efficient Answer Set Programming [chapter]

Enrico Giunchiglia, Marco Maratea
2005 Lecture Notes in Computer Science  
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related.  ...  Our results show that, despite the strong link between ASP and SAT, it is not always the case that search strategies, heuristics and/or their combinations that currently dominate in SAT are also bound  ...  We say that X is an answer set for Π if X is an answer set for Π X . Now we want to introduce the relation between the answer sets of a program Π and the models of the completion of Π.  ... 
doi:10.1007/11558590_13 fatcat:uw3p7ukpqnf23b3oyzb6ge5hnu

Extended ASP Tableaux and rule redundancy in normal logic programs

MATTI JÄRVISALO, EMILIA OIKARINEN
2008 Theory and Practice of Logic Programming  
The proof system is based on the ASP tableaux defined in the work by Gebser and Schaub (Tableau calculi for answer set programming.  ...  Closely related to Extended ASP Tableaux, we empirically investigate the effect of redundant rules on the efficiency of ASP solving.  ...  Foundation TES, and the Nokia Foundation (EO) is gratefully acknowledged.  ... 
doi:10.1017/s1471068408003578 fatcat:fdqwcjviqzaiplpjpt2egippqa

A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems [chapter]

Agostino Dovier, Andrea Formisano, Enrico Pontelli
2005 Lecture Notes in Computer Science  
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Programming (CLP) over finite  ...  The objective is to identify how the solvers in the two domains respond to different problems, highlighting strengths and weaknesses of their implementations and suggesting criteria for choosing one approach  ...  The CModels system makes use of a SAT solver to compute answer sets-in our experiments we selected the default underlying SAT solver, namely mChaff.  ... 
doi:10.1007/11562931_8 fatcat:dqei4cmlhzclxhsxz6c3qns44m

Evaluating ASP and Commercial Solvers on the CSPLib

Toni Mancini, Davide Micaletto, Fabio Patrizi, Marco Cadoli
2008 Constraints  
This paper 1 deals with four solvers for combinatorial problems: the commercial state-of-the-art solver Ilog opl, and the research ASP systems dlv, smodels and cmodels.  ...  Finally, we evaluate, on a subset of the problems, the impact of numbers and arithmetic constraints on the different solving technologies.  ...  The systems we consider are one commercial state-of-the-art solver, i.e., Ilog opl and three ASP solvers, namely dlv, smodels, and cmodels.  ... 
doi:10.1007/s10601-007-9028-6 fatcat:u3hqfi7svneohnppoha7fydsh4
« Previous Showing results 1 — 15 out of 109 results