On look-ahead heuristics in disjunctive logic programming

DOI10.1007/s10472-008-9087-4zbMath1138.68018MaRDI QIDQ2426102

Nicola Leone, Wolfgang Faber, Gerald Pfeifer, Francesco Ricca

Publication date: 21 April 2008

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-008-9087-4

zbMATH Keywords

Logic programming; Artificial intelligence; Heuristics; Nonmonotonic reasoning; Answer set programming; Efficient evaluation; Stable models

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68N17: Logic programming

Uses Software

• ASSAT
• Chaff
• BerkMin
• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ASSAT: computing answer sets of a logic program by SAT solvers
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Extending and implementing the stable model semantics
• Branching rules for satisfiability
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional semantics for disjunctive logic programs
• BerkMin: A fast and robust SAT-solver
• Logic programming and knowledge representation
• The complexity of logic-based abduction
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Experimenting with Look-Back Heuristics for Hard ASP Programs
• Conflict-Driven Answer Set Enumeration
• Logic Programming and Nonmonotonic Reasoning