Engineering an Incremental ASP Solver
From MaRDI portal
Publication:5504656
DOI10.1007/978-3-540-89982-2_23zbMath1185.68159OpenAlexW1501758783WikidataQ56755028 ScholiaQ56755028MaRDI QIDQ5504656
Max Ostrowski, Roland Kaminski, Torsten Schaub, Sven Thiele, Martin Gebser, Benjamin Kaufmann
Publication date: 22 January 2009
Published in: Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_23
Related Items
Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies ⋮ Applications of Action Languages in Cognitive Robotics ⋮ Gearing Up for Effective ASP Planning ⋮ Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming ⋮ LARS: a logic-based framework for analytic reasoning over streams ⋮ LoCo—A Logic for Configuration Problems ⋮ ASPeRiX, a first-order forward chaining approach for answer set computing ⋮ Knowledge-based multi-criteria optimization to support indoor positioning ⋮ A weighted causal theory for acquiring and utilizing open knowledge ⋮ A computational framework for conceptual blending ⋮ Conflict-driven answer set solving: from theory to practice ⋮ Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving ⋮ Multi-shot ASP solving with clingo ⋮ The Seventh Answer Set Programming Competition: Design and Results ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ Abstraction for non-ground answer set programs ⋮ Answer Set Programming: A Primer ⋮ Rule-based Stream Reasoning for Intelligent Administration of Content-Centric Networks ⋮ Graph-based construction of minimal models
Uses Software
Cites Work
- Unnamed Item
- Nonmonotonic causal theories
- ASSAT: computing answer sets of a logic program by SAT solvers
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Semantics of (disjunctive) logic programs based on partial evaluation
- Logic Programming and Nonmonotonic Reasoning
- Conflict-Driven Answer Set Enumeration
- Bounded model checking using satisfiability solving
