Logic programming with infinite sets

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.

• Type: Journal
• Year: 2005
• Where: AMAI
• Authors: Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek
• Keywords: AMAI 2005, Artificial Intelligence, Current Investigations, Knowledge Representation, Various Infinite Sets