Stable-unstable semantics: Beyond NP with normal logic programs

DOI10.1017/S1471068416000387zbMath1379.68044arXiv1608.01835MaRDI QIDQ4593043

Tomi Janhunen, Shahab Tasharrofi, Bart Bogaerts

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.01835

zbMATH Keywords

disjunctive logic programmingpolynomial hierarchyquantified Boolean formulas

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

Beyond NP: Quantifying over Answer Sets ⋮ Solving problems in the polynomial hierarchy with ASP(Q) ⋮ The Seventh Answer Set Programming Competition: Design and Results ⋮ Solving Advanced Argumentation Problems with Answer Set Programming ⋮ Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations ⋮ Knowledge representation analysis of graph mining ⋮ Writing Declarative Specifications for Clauses

Uses Software

• Gringo
• DLV
• clasp
• ROSoClingo
• IDP3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving parity games by a reduction to SAT
• Design and results of the Fifth Answer Set Programming Competition
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional semantics for disjunctive logic programs
• Logic programs with stable model semantics as a constraint programming paradigm
• Inferring phylogenetic trees using answer set programming
• Normalizing Cardinality Rules Using Merging and Sorting Constructions
• Simulating Dynamic Systems Using Linear Time Calculus Theories
• Complex optimization in answer set programming
• On a generalization of quantifiers
• Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
• Integrating ASP into ROS for Reasoning in Robots
• Progress in clasp Series 3
• Abstract gringo
• Optimizing phylogenetic supertrees using answer set programming
• Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3
• Unfolding partiality and disjunctions in stable model semantics
• The DLV system for knowledge representation and reasoning
• A Tarskian Informal Semantics for Answer Set Programming
• Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions

This page was built for publication: Stable-unstable semantics: Beyond NP with normal logic programs