Loop-separable programs and their first-order definability

Authors:
Yin Chen;Fangzhen Lin;Yan Zhang;Yi Zhou
Affiliations:
Department of Computer Science, South China Normal University, Guangzhou, Guangdong, China;Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;Intelligent Systems Lab, School of Computing and Mathematics, University of Western Sydney, Penrith South DC, NSW 1797, Australia;Intelligent Systems Lab, School of Computing and Mathematics, University of Western Sydney, Penrith South DC, NSW 1797, Australia
Venue:
Artificial Intelligence
Year:
2011

Citing 20
Cited 3

On the first-order expressibility of recursive queries

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the equivalence of recursive and nonrecursive datalog programs

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A study of nonmonotonic reasoning

A study of nonmonotonic reasoning
Datalog vs first-order logic

Proceedings of the 30th IEEE symposium on Foundations of computer science
A non-ground realization of the stable and well-founded semantics

Theoretical Computer Science
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Computing Circumscription Revisited: A Reduction Algorithm

Journal of Automated Reasoning
The Smodels System

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Computing Non-Ground Representations of Stable Models

LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
ASSAT: computing answer sets of a logic program by SAT solvers

Artificial Intelligence - Special issue on nonmonotonic reasoning
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
Well-founded and stable semantics of logic programs with aggregates

Theory and Practice of Logic Programming
From SPARQL to rules (and back)

Proceedings of the 16th international conference on World Wide Web
Modeling Biological Networks by Action Languages via Answer Set Programming

Constraints
Combining answer set programming with description logics for the Semantic Web

Artificial Intelligence
Quantified Equilibrium Logic and Foundations for Answer Set Programs

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
HAPLO-ASP: Haplotype Inference Using Answer Set Programming

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A new perspective on stable models

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Conflict-driven answer set solving

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
From answer set logic programming to circumscription via logic of GK

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Ordered completion for first-order logic programs on finite structures

Artificial Intelligence
First-order stable model semantics and first-order loop formulas

Journal of Artificial Intelligence Research
First-order expressibility and boundedness of disjunctive logic programs

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence. Characterizing classes of programs that are first-order definable on finite structures is theoretically challenging and of practical relevance to answer set programming. In this paper, we identify a non-trivial class of answer set programs called loop-separable programs and show that they are first-order definable on finite structures.