Answer Set Programming without Unstratified Negation

DOI10.1007/978-3-540-89982-2_15MaRDI QIDQ5504649zbMATH OpenOpenAlexFDO

Authors Ilkka Niemelä

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_15

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• Constraint answer set programming without grounding
• Revisiting explicit negation in answer set programming
• Answer set programming based on propositional satisfiability
• Answer set programming in intuitionistic logic
• scientific article; zbMATH DE number 1882048
• Negation by default and unstratifiable logic programs
• On structural analysis of non-ground answer-set programs
• Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
• Abstraction for non-ground answer set programs

Cites work

• Extending and implementing the stable model semantics
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• scientific article; zbMATH DE number 1453071 (Why is no real title available?)
• Logic programs with monotone abstract constraint atoms
• Logic programs with stable model semantics as a constraint programming paradigm

Cited in

(6)

• Evaluating epistemic negation in answer set programming
• Answer Synthesis for CLP Programs with Negation
• Planning with Incomplete Information in Quantified Answer Set Programming
• Foundations of Information and Knowledge Systems
• Answer set programming made easy
• On the foundations of grounding in answer set programming

This page was built for publication: Answer Set Programming without Unstratified Negation

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