Query answering in resource-based answer set semantics

DOI10.1017/S1471068416000478zbMath1379.68052arXiv1608.01604MaRDI QIDQ4593046

Stefania Costantini, Andrea Formisano

Publication date: 9 November 2017

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

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

zbMATH Keywords

procedural semantics; answer set programming; top-down query-answering

Mathematics Subject Classification ID

03B70: Logic in computer science

68Q55: Semantics in the theory of computing

68N17: Logic programming

Related Items

Unnamed Item, Better Paracoherent Answer Sets with Less Resources, About Epistemic Negation and World Views in Epistemic Logic Programs, Adding Metalogic Features to Knowledge Representation Languages*

Uses Software

• XSB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantics and complexity of recursive aggregates in answer set programming
• Design and results of the Fifth Answer Set Programming Competition
• On the relation among answer set solvers
• Extending and implementing the stable model semantics
• Abduction in logic programming: A new definition and an abductive procedure based on rewriting
• XSB: Extending Prolog with Tabled Logic Programming
• Dynamic Consistency Checking in Goal-Directed Answer Set Programming
• Weight Constraints with Preferences in ASP
• Negation as a Resource: a Novel View on Answer Set Semantics*
• Monotonic Answer Set Programming
• Answer Set Programming with Resources
• Logic Programming for Knowledge Representation
• A goal-oriented approach to computing the well-founded semantics
• Autoepistemic logic
• The well-founded semantics for general logic programs
• Logic programming and negation: A survey
• Knowledge Representation, Reasoning and Declarative Problem Solving
• RASP and ASP as a fragment of linear logic
• Tableau Calculi for Answer Set Programming