Access the full text.
Sign up today, get DeepDyve free for 14 days.
P. Simons, I. Niemelä, T. Soininen (2000)
Extending and implementing the stable model semanticsArtif. Intell., 138
Fangzhen Lin, Yuting Zhao (2002)
ASSAT: computing answer sets of a logic program by SAT solvers
Wolfgang Faber, N. Leone, M. Maratea, F. Ricca (2007)
Experimenting with Look-Back Heuristics for Hard ASP Programs
Tran Son, Enrico Pontelli (2006)
A Constructive semantic characterization of aggregates in answer set programmingTheory and Practice of Logic Programming, 7
F. Ricca, Antonella Dimasi, G. Grasso, S. Ielpa, S. Iiritano, M. Manna, N. Leone (2010)
A Logic-Based System for e-TourismFundam. Informaticae, 105
Wolfgang Faber, G. Pfeifer, N. Leone, Tina Dell'Armi, Giuseppe Ielpa (2008)
Design and implementation of aggregate functions in the DLV system*Theory and Practice of Logic Programming, 8
J. Gaschnig (1977)
A General Backtrack Algorithm That Eliminates Most Redundant Tests
(2007)
Confl ict-Driven Answer Set Solving,Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07)
(2002)
Lparse 1.0 User’s Manual, 2002, http://www.tcs.hut.fi/Software/smodels/lparse
I. Niemelä, P. Simons, T. Soininen (1999)
Stable Model Semantics of Weight Constraint Rules
Jeffrey Ward, J. Schlipf (2004)
Answer Set Programming with Clause Learning
(2006)
A Backjumping Techniqu e for Disjunctive Logic Programming, AI Communications – The European Journal on Artificial Intelligence
Wolfgang Faber, N. Leone, G. Pfeifer (2004)
Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity
P. Ferraris, V. Lifschitz (2003)
Weight constraints as nested expressionsTheory and Practice of Logic Programming, 5
M. Moskewicz, Conor Madigan, Ying Zhao, Lintao Zhang, S. Malik (2001)
Chaff: engineering an efficient SAT solverProceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
E. Giunchiglia, Massimo Narizzano, A. Tacchella (2001)
Backjumping for Quantified Boolean Logic satisfiabilityArtif. Intell., 145
SIZE) and in shorter time; it is also the best on TimeTabling where, even if standard DLV solves the same number of instances, it gains one order of magnitude considering mean CPU time (while DLV
N. Leone, G. Pfeifer, Wolfgang Faber, Thomas Eiter, G. Gottlob, S. Perri, Francesco Scarcello (2002)
The DLV system for knowledge representation and reasoningACM Trans. Comput. Log., 7
Look-back Techniques for ASP Programs with Aggregates the WeightedLatinSquares domain, where it solves 4 (resp. 19) instances more than standard DLV (resp
R. Bayardo, R. Schrag (1997)
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
Joohyung Lee, Yunsong Meng (2009)
On Reductive Semantics of Aggregates in Answer Set Programming
M. Gelfond, V. Lifschitz (1991)
Classical negation in logic programs and disjunctive databasesNew Generation Computing, 9
M. Maratea, F. Ricca, Wolfgang Faber, N. Leone (2008)
Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solversJ. Algorithms, 63
Y. Lierler (2005)
Disjunctive Answer Set Programming via Satisfiability
Wolfgang Faber (2002)
Enhancing Eciency and Expressiveness in Answer Set Programming Systems
Chitta Baral (2003)
Knowledge Representation, Reasoning and Declarative Problem Solving
P. Prosser (1993)
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 9
Wolfgang Faber, N. Leone, G. Pfeifer, F. Ricca (2007)
On look-ahead heuristics in disjunctive logic programmingAnnals of Mathematics and Artificial Intelligence, 51
M. Gebser, Torsten Schaub, S. Thiele (2007)
GrinGo : A New Grounder for Answer Set Programming
Francesco Calimeri, Wolfgang Faber, N. Leone, G. Pfeifer (2002)
Pruning operators for answer set programming systems
Martin Davis, G. Logemann, D. Loveland (2011)
A machine program for theorem-provingCommun. ACM, 5
Joao Marques-Silva, K. Sakallah (1999)
GRASP: A Search Algorithm for Propositional SatisfiabilityIEEE Trans. Computers, 48
M. Gebser, R. Kaminski, B. Kaufmann, Torsten Schaub (2009)
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
Tina Dell'Armi, Wolfgang Faber, Giuseppe Ielpa, N. Leone, G. Pfeifer (2003)
Aggregate Functions in DLV
Look-back Techniques for ASP Programs with Aggregates sidering the mean time, DLV.BJA.VS.EQ is more than 4 times faster than DLV (8.57 vs 36.71 seconds), and it is nearly 3 times faster than DLV
Tran Son, Enrico Pontelli (2005)
Under Consideration for Publication in Theory and Practice of Logic Programming a Constructive Semantic Characterization of Aggregates in Answer Set Programming
Nikolay Pelov, M. Denecker, M. Bruynooghe (2005)
Well-founded and stable semantics of logic programs with aggregatesTheory and Practice of Logic Programming, 7
R. Dechter (1990)
Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset DecompositionArtif. Intell., 41
Wolfgang Faber, N. Leone, G. Pfeifer (1999)
Pushing Goal Derivation in DLP Computations
J. Gaschnig (1979)
Performance measurement and analysis of certain search algorithms.
M. Gebser, Lengning Liu, Gayathri Namasivayam, A. Neumann, Torsten Schaub, M. Truszczynski (2007)
The First Answer Set Programming System Competition
R. Dechter, Daniel Frost (2002)
Backjump-based backtracking for constraint satisfaction problemsArtif. Intell., 136
M. Gebser, B. Kaufmann, A. Neumann, Torsten Schaub (2007)
Conflict-Driven Answer Set Solving
M. Gebser, B. Kaufmann, A. Neumann, Torsten Schaub (2007)
clasp : A Conflict-Driven Answer Set Solver
E. Giunchiglia, Y. Lierler, M. Maratea (2006)
Answer Set Programming Based on Propositional SatisfiabilityJournal of Automated Reasoning, 36
F. Ricca, Wolfgang Faber, N. Leone (2006)
A backjumping technique for Disjunctive Logic ProgrammingAI Commun., 19
T. Janhunen, I. Niemelä (2004)
GNT - A Solver for Disjunctive Logic Programs
(2006)
and N
Elena Bellodi, E. Lamma, Fabrizio Riguzzi, V. Costa, Riccardo Zese (2014)
Lifted Variable Elimination for Probabilistic Logic ProgrammingTheory and Practice of Logic Programming, 14
M. Denecker, Joost Vennekens, Stephen Bond, M. Gebser, M. Truszczynski (2009)
The Second Answer Set Programming Competition
Wolfgang Faber, F. Ricca (2005)
Solving Hard ASP Programs Efficiently
Chitta Baral (2003)
Knowledge Representation, Reasoning and Declarative Problem Solving: Query answering and answer set computing systems
I. Niemelä, P. Simons (1997)
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
The introduction of aggregates has been one of the most relevant language extensions to Answer Set Programming (ASP). Aggregates are very expressive, they allow to represent many problems in a more succinct and elegant way compared to aggregate-free programs. A significant amount of research work has been devoted to aggregates in the ASP community in the last years, and relevant research results on ASP with aggregates have been published, on both theoretical and practical sides. The high expressiveness of aggregates (eliminating aggregates often causes a quadratic blow-up in program size) requires suitable evaluation methods and optimization techniques for an efficient implementation. Nevertheless, in spite of the above-mentioned research developments, aggregates are treated in a quite straightforward way in most ASP systems. In this paper, we explore the exploitation of look-back techniques for an efficient implementation of aggregates. We define a reason calculus for backjumping in ASP programs with aggregates. Furthermore, we describe how these reasons can be used in order to guide look-back heuristics for programs with aggregates. We have implemented both the new reason calculus and the proposed heuristics in the DLV system, and have carried out an experimental analysis on publicly available benchmarks which shows significant performance benefits.
Fundamenta Informaticae – IOS Press
Published: Jan 1, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.