LOOP - A language for LP-based AI applications

被引:0
|
作者
Suciu, A [1 ]
Pusztai, K [1 ]
Muresan, T [1 ]
Simon, Z [1 ]
机构
[1] Tech Univ Cluj Napoca, Dept Comp Sci, RO-3400 Cluj Napoca, Romania
来源
ICTAI 2001: 13TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS | 2001年
关键词
D O I
10.1109/ICTAI.2001.974477
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
One major drawback of logic programming, particularly Prolog, is the lack of mechanisms for structuring knowledge (i,e. program clauses). This makes programming-in-the-large a difficult task even using the module system. To overcome this, various attempts were made to extend the logic programming paradigm with object-oriented features. In [4] we introduced LOOP, a class-based, logic and object-oriented programming language, centered around the view of objects as persistent mutable terms with backtrackable state, which extends Prolog in a simple and straightforward fashion. To validate our ideas we recently developed a prototype based on expansion to Prolog code, implemented in Sicstus Prolog, a state of the art Prolog system which supports mutable terms with backtrackable destructive assignment.
引用
收藏
页码:299 / 305
页数:7
相关论文
共 50 条
  • [41] LP-based online scheduling: From single to parallel machines
    Correa, JR
    Wagner, MR
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2005, 3509 : 196 - 209
  • [42] The explicit solution of constrained LP-based receding horizon control
    Bemporad, A
    Borrelli, F
    Morari, M
    PROCEEDINGS OF THE 39TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-5, 2000, : 632 - 637
  • [43] Fast LP-based Approximations for Geometric Packing and Covering Problems
    Chekuri, Chandra
    Har-Peled, Sariel
    Quanrud, Kent
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1019 - 1038
  • [44] The economic lot scheduling problem - survey and LP-based method
    Carstensen, P
    OR SPEKTRUM, 1999, 21 (04) : 429 - 460
  • [45] A new LP-based lower bound for the cumulative scheduling problem
    Carlier, J
    Néron, E
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 127 (02) : 363 - 382
  • [46] LP-based tractable subcones of the semidefinite plus nonnegative cone
    Tanaka, Akihiro
    Yoshise, Akiko
    ANNALS OF OPERATIONS RESEARCH, 2018, 265 (01) : 155 - 182
  • [47] LP-based online scheduling: from single to parallel machines
    Correa, Jose R.
    Wagner, Michael R.
    MATHEMATICAL PROGRAMMING, 2009, 119 (01) : 109 - 136
  • [48] An LP-based approach for loading and routing in a flexible assembly line
    Sawik, T
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2000, 64 (1-3) : 49 - 58
  • [49] A novel LP-based Neighborhood search for general integer programs
    Zhang, Xinhui
    Hill, Raymond R.
    WMSCI 2006: 10TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL VI, PROCEEDINGS, 2006, : 63 - 68