An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems

被引:18
|
作者
Dovier, Agostino [2 ]
Formisano, Andrea [3 ]
Pontelli, Enrico [1 ]
机构
[1] New Mexico State Univ, Dept Comp Sci, Las Cruces, NM 88003 USA
[2] Univ Udine, Dipartimento Matemat & Informat, I-33100 Udine, Italy
[3] Univ Perugia, Dipartimento Matemat & Informat, I-06123 Perugia, Italy
基金
美国国家科学基金会;
关键词
logic programming; combinatorial problems; constraint solving;
D O I
10.1080/09528130701538174
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents experimental comparisons between the declarative encodings of various computationally hard problems in Answer Set Programming (ASP) and Constraint Logic Programming over Finite Domains (CLP(FD)). The objective is to investigate how solvers in the two domains respond to different problems, highlighting the strengths and weaknesses of their implementations, and suggesting criteria for choosing one approach over the other. Ultimately, the work in this paper is expected to lay the foundations for a transfer of technology between the two domains, for example by suggesting ways to use CLP(FD) in the execution of ASP.
引用
收藏
页码:79 / 121
页数:43
相关论文
共 50 条
  • [21] SOLVING LARGE COMBINATORIAL PROBLEMS IN LOGIC PROGRAMMING
    DINCBAS, M
    SIMONIS, H
    VANHENTENRYCK, P
    JOURNAL OF LOGIC PROGRAMMING, 1990, 8 (1-2): : 75 - 93
  • [22] Interpolable Formulas in Equilibrium Logic and Answer Set Programming
    Gabbay, Dov
    Pearce, David
    Valverde, Agustin
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2011, 42 : 917 - 943
  • [23] Applications qf intuitionistic logic in answer set programming
    Osorio, M
    Navarro, JA
    Arrazola, J
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2004, 4 : 325 - 354
  • [24] Synonymous theories in answer set programming and equilibrium logic
    Pearce, D
    Valverde, A
    ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 388 - 392
  • [25] From Answer Set Logic Programming to Circumscription via Logic of GK
    Lin, Fangzhen
    Zhou, Yi
    20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2007, : 441 - 446
  • [26] From answer set logic programming to circumscription via logic of GK
    Lin, Fangzhen
    Zhou, Yi
    ARTIFICIAL INTELLIGENCE, 2011, 175 (01) : 264 - 277
  • [27] Justifications for Goal-Directed Constraint Answer Set Programming
    Arias, Joaquin
    Carro, Manuel
    Chen, Zhuo
    Gupta, Gopal
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2020, (325): : 59 - 72
  • [28] Business process verification with constraint temporal answer set programming
    Giordano, Laura
    Martelli, Alberto
    Spiotta, Matteo
    Dupre, Daniele Theseider
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2013, 13 : 641 - 655
  • [29] Constraint logic programming for qualitative and quantitative constraint satisfaction problems
    Lee, HG
    Lee, RM
    Yu, G
    DECISION SUPPORT SYSTEMS, 1996, 16 (01) : 67 - 83
  • [30] Answer Set Programming
    Marek, Victor W.
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2020, 20 (03) : 432 - 434