ASP Solving for Expanding Universes

DOI10.1007/978-3-319-23264-5_30zbMath1467.68025OpenAlexW2407553922MaRDI QIDQ3449219

Holger Jost, Martin Gebser, Torsten Schaub, Roland Kaminski, Tomi Janhunen

Publication date: 4 November 2015

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23264-5_30

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• ASPeRiX
• ASSAT
• Clingo
• OMiGA

Cites Work

• Unnamed Item
• Unnamed Item
• ASSAT: computing answer sets of a logic program by SAT solvers
• Design and results of the Fifth Answer Set Programming Competition
• Extending and implementing the stable model semantics
• Planning as satisfiability: parallel plans and algorithms for plan search
• Modularity Aspects of Disjunctive Stable Models
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Multi-shot ASP solving with clingo
• Lazy Model Expansion by Incremental Grounding
• A Computing Procedure for Quantification Theory

This page was built for publication: ASP Solving for Expanding Universes