Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Arithmetic classification of perfect models of stratified programs
Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
Proceedings of the eleventh international conference on Logic programming
Compiling intensional sets in CLP
Proceedings of the eleventh international conference on Logic programming
Extending the Smodels system with cardinality and weight constraints
Logic-based artificial intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Extending and implementing the stable model semantics
Artificial Intelligence
Constraint Databases
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Modular Logic Programming and Generalized Quantifiers
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Locally Determined Logic Programs and Recursive Stable Models
Annals of Mathematics and Artificial Intelligence
Reasoning with infinite stable models
Artificial Intelligence
Reasoning with infinite stable models
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
My work with Victor Marek: a mathematician looks at answer set programming
Annals of Mathematics and Artificial Intelligence
The complexity of inductive definability
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
| Hi-index | 0.00 |
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Our programs reason about the codes for various infinite sets. Depending on the form of atoms allowed in the bodies of clauses we obtain a variety of completeness results for various classes of arithmetic sets of integers.