Answer set programming made easy

DOI10.1007/978-3-031-31476-6_7zbMath1529.68070arXiv2111.06366OpenAlexW3214151432MaRDI QIDQ6175107

Jorge Fandinno, Javier Romero, Seemran Mishra, Torsten Schaub

Publication date: 17 August 2023

Published in: Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.06366

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Equilibrium logic
• Disjunctive \(LP+\) integrity constraints = stable model semantics.
• Answer set programming and plan generation
• Extending and implementing the stable model semantics
• Forgetting auxiliary atoms in forks
• Train scheduling with hybrid ASP
• Verifying strong equivalence of programs in the input language of \textsc{gringo}
• Logic programming and nonmonotonic reasoning. 15th international conference, LPNMR 2019, Philadelphia, PA, USA, June 3--7, 2019. Proceedings
• The well-founded semantics for general logic programs
• Achievements in answer set programming
• Abstract gringo
• Weight constraints as nested expressions
• ASP-Core-2 Input Language Format
• Multi-shot ASP solving with clingo
• The DLV system for knowledge representation and reasoning
• A Tarskian Informal Semantics for Answer Set Programming
• Answer Set Programming without Unstratified Negation
• Extending stratified datalog to capture complexity classes ranging from \(\mathcal P\) to \(Cal Q\mathcal H\)

This page was built for publication: Answer set programming made easy