Journal of the ACM (JACM)
Proceedings of the eleventh international conference on Logic programming
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Reasoning with infinite stable models
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Reasoning with Infinite Stable Models II: Disjunctive Programs
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Here's the Beef: Answer Set Programming !
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Partial Functions and Equality in Answer Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Computable Functions in ASP: Theory and Implementation
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Composing Normal Programs with Function Symbols
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
One More Decidable Class of Finitely Ground Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A First Order Forward Chaining Approach for Answer Set Computing
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
On the Input Language of ASP Grounder Gringo
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A decidable subclass of finitary programs
Theory and Practice of Logic Programming
Disjunctive asp with functions: Decidable queries and effective computation*
Theory and Practice of Logic Programming
A 25-year perspective on logic programming
Functional answer set programming
Theory and Practice of Logic Programming
ASP at work: spin-off and applications of the DLV system
Logic programming, knowledge representation, and nonmonotonic reasoning
Weight constraint programs with evaluable functions
Annals of Mathematics and Artificial Intelligence
Guarded open answer set programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
External sources of computation for answer set solvers
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Decidable fragments of logic programming with value invention
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Effective integration of declarative rules with external evaluations for semantic-web reasoning
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Guarded open answer set programming with generalized literals
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
Detecting decidable classes of finitely ground logic programs with function symbols
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Bounded programs: a new decidable class of logic programs with function symbols
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Computing stable models for nonmonotonic existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Acyclicity notions for existential rules and their application to query answering in ontologies
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We define a new syntactic class of logic programs, omega-restricted programs. We divide the predicate symbols of a logic program into two parts: domain and non-domain predicates, where the domain predicates are defined by the maximal stratifiable subset of the rules of the program. We extend the usual definition of stratification by adding a special omega-stratum that holds all unstratifiable predicates of the program. We demand that all variables that occur in a rule also occur in the rule body in a positive literal that is on a lower stratum than rule head. This restriction is syntactic and can be checked efficiently. The existence of a stable model of an omega-restricted program is decidable even when function symbols are allowed. We prove that the problem is 2- NEXP-complete and identify subclasses of omega-restricted programs such that the problem stays in NEXP or NP. The class of omegarestricted programs is implemented in the Smodels system.