Stable model semantics for founded bounds

DOI10.1017/S147106841300032XzbMath1286.68038MaRDI QIDQ5398292

Rehan Abdul Aziz, Peter J. Stuckey, Geoffrey Chu

Publication date: 27 February 2014

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

zbMATH Keywords

answer set programmingstable model semanticsfinite domain solving

Mathematics Subject Classification ID

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

Related Items (2)

Clingcon: The next generation ⋮ ASP (): Answer Set Programming with Algebraic Constraints

Uses Software

• Chaff
• Clingcon

Cites Work

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

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