Answer set programming made easy

DOI10.1007/978-3-031-31476-6_7MaRDI QIDQ6175107zbMATH OpenOpenAlexFDO

Authors Jorge Fandinno, Seemran Mishra, Javier Romero, 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 programming (68N17) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Abstract: We take up an idea from the folklore of Answer Set Programming, namely that choices, integrity constraints along with a restricted rule format is sufficient for Answer Set Programming. We elaborate upon the foundations of this idea in the context of the logic of Here-and-There and show how it can be derived from the logical principle of extension by definition. We then provide an austere form of logic programs that may serve as a normalform for logic programs similar to conjunctive normalform in classical logic. Finally, we take the key ideas and propose a modeling methodology for ASP beginners and illustrate how it can be used.

Recommendations

• Answer set programming
• Answer set programming
• Answer Set Programming: A Primer
• Answer set; programming?
• Answer set programming with external sources
• Answer Set Programming with Resources

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175107)