Stable model semantics for founded bounds

DOI10.1017/S147106841300032XMaRDI QIDQ5398292zbMATH OpenFDO

Authors Rehan Abdul Aziz, Geoffrey Chu, Peter J. Stuckey

Publication date 27 February 2014

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S147106841300032X

zbMATH Keywords

answer set programmingfinite domain solvingstable model semantics

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Optimum stable model search: algorithms and implementation
• Answer Set Programming: A Primer
• An Introduction to Answer Set Programming and Some of Its Extensions
• scientific article; zbMATH DE number 6747915
• Constraint Answer Set Solving

Cites work

• A translational approach to constraint answer set solving
• Extending and implementing the stable model semantics
• Integrating answer set programming and constraint logic programming
• Knowledge Representation, Reasoning and Declarative Problem Solving

Cited in

(6)

• Extending and implementing the stable model semantics
• Lower bound founded logic of here-and-there
• \textit{clingcon}: the next generation
• \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints
• Lazy atom discovery in compilation-based ASP solving
• Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck

Describes a project that uses

Uses Software

• Chaff
• Clingcon

This page was built for publication: Stable model semantics for founded bounds

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