Logic programming with infinite sets

被引：3
|
作者：
Cenzer, D [1 ]
Remmel, JB
Marek, VW
机构：
[1] Univ Florida, Gainesville, FL 32611 USA
[2] Univ Calif San Diego, La Jolla, CA 92093 USA
[3] Univ Kentucky, Lexington, KY 40506 USA
来源：
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE | 2005年 / 44卷 / 04期
基金：
美国国家科学基金会;
关键词：
nonmonotonic logic; logic programming;
D O I：
10.1007/s10472-005-7030-5
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页码：309 / 339
页数：31
相关论文
共 50 条
  • [1] Logic programming with infinite sets
    Douglas Cenzer
    Jeffrey B Remmel
    Victor W. Marek
    Annals of Mathematics and Artificial Intelligence, 2005, 44 : 309 - 339
  • [2] LOGIC PROGRAMMING WITH SETS
    KUPER, GM
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1990, 41 (01) : 44 - 64
  • [3] Sets and constraint logic programming
    Dovier, A
    Piazza, C
    Pontelli, E
    Rossi, G
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2000, 22 (05): : 861 - 931
  • [4] SEMANTICS OF INFINITE TREE LOGIC PROGRAMMING
    JAFFAR, J
    STUCKEY, PJ
    THEORETICAL COMPUTER SCIENCE, 1986, 46 (2-3) : 141 - 158
  • [5] ON THE INTERPRETATION OF INFINITE COMPUTATIONS IN LOGIC PROGRAMMING
    ABDALLAH, MAN
    LECTURE NOTES IN COMPUTER SCIENCE, 1984, 172 : 358 - 370
  • [6] A logic programming framework for rough sets
    Vitória, A
    Maluszynski, J
    ROUGH SETS AND CURRENT TRENDS IN COMPUTING, PROCEEDINGS, 2002, 2475 : 205 - 212
  • [7] A language for programming logic with finite sets
    Dovier, Agostino
    Omodeo, Eugenio G.
    Pontelli, Enrico
    Rossi, Gianfranco
    Journal of Logic Programming, 1996, 28 (01):
  • [8] SYLLOGISTIC LOGIC WITH CARDINALITY COMPARISONS, ON INFINITE SETS
    Moss, Lawrence S.
    Topal, Selcuk
    REVIEW OF SYMBOLIC LOGIC, 2020, 13 (01): : 1 - 22
  • [9] AUTOMATA ON INFINITE OBJECTS AND THEIR APPLICATIONS TO LOGIC AND PROGRAMMING
    NIVAT, M
    SAOUDI, A
    INFORMATION AND COMPUTATION, 1989, 83 (01) : 41 - 64
  • [10] Expressing Preferences in Logic Programming using an Infinite-Valued Logic
    Rondogiannis, Panos
    Troumpoukis, Antonis
    PROCEEDINGS OF THE 17TH INTERNATIONAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING (PPDP 2015), 2015, : 208 - 219
12345