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

Dovier, Agostino; Formisano, Andrea; Pontelli, Enrico

doi:10.1080/09528130701538174

Cited by 26 publications

(17 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…the aggregates). Interesting line of work investigates ways of replacing ASP programs by the corresponding constraint programs (see for instance (Dovier, Formisano, & Pontelli 2007)). We hope that our approach will prove more attractive from the standpoint of knowledge representation and also more efficient but this is of course a matter for further research.…”

Section: Resultsmentioning

confidence: 99%

Integrating answer set programming and constraint logic programming

Mellarkod

Gelfond

Zhang

2008

Ann Math Artif Intell

View full text Add to dashboard Cite

We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, for computing answer sets of AC(C) programs. The algorithm does not require full grounding of a program and combines "classical" ASP solving methods with constraint logic programming techniques and CR-Prolog based abduction. The AC(C) based approach often allows to solve problems which are impossible to solve by more traditional ASP solving techniques. We belief that further investigation of the language and development of more efficient and reliable solvers for its programs can help to substantially expand the domain of applicability of the answer set programming paradigm.

show abstract

Section: Resultsmentioning

confidence: 99%

Integrating answer set programming and constraint logic programming

Mellarkod

Gelfond

Zhang

2008

Ann Math Artif Intell

View full text Add to dashboard Cite

show abstract

“…2 The expressive power of ASP, as well as its computational complexity, have been thoroughly investigated. The interested reader can refer to Dantsin, Eiter, Gottlob, and Voronkov (2001), as well as Baral (2003), and Dovier, Formisano, and Pontelli (2009), among others, for a presentation of ASP as a tool for declarative problem solving.…”

Section: Then Remove Each Literal Not a From The Remaining Rulesmentioning

confidence: 99%

RASP and ASP as a fragment of linear logic

Costantini

Formisano

2013

Journal of Applied Non-Classical Logics

Self Cite

View full text Add to dashboard Cite

RASP is a recent extension to Answer Set Programming (ASP) that permits declarative specification and reasoning on the consumption and production of resources. ASP can be seen as a particular case of RASP. In this paper, we study the relationship between linear logic and RASP problem specification. We prove that RASP programs can be translated into (a fragment of) linear logic, and vice versa. In doing so, we introduce a linear logic representation of default negation as understood in ASP. We are also able to establish a link between linear logic and here-and-there (HT) logic.

show abstract

“…The variables of the problem were defined, along with the related constraints and some possible neighbourhoods which were used to obtain the solution. Dovier et al (2009) designed empirical comparisons between constraint logic programming and answer set programming by using some combinatorial problems to select the most efficient approach for each problem.…”

Section: Solution Techniquesmentioning

confidence: 99%

A job-shop scheduling approach for optimising sugarcane rail operations

2011

View full text Add to dashboard Cite

The sugarcane transport system is very complex and uses a daily schedule, consisting of a set of locomotives runs, to satisfy the requirements of the mill and harvesters. The total cost of sugarcane transport operations is very high; over 35% of the total cost of sugarcane production in Australia is incurred in cane transport. Producing efficient schedules for sugarcane transport can reduce the cost and limit the negative effects that this system can have on the raw sugar production system. In this paper, the sugarcane rail operations are formulated as a blocking job shop scheduling problem. A mixed integer programming approach is used to formulate the shop job scheduling problem. Mixed integer programming and constraint programming search techniques are integrated for solving the problem. A case study is solved to test the approach.

show abstract

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

Cited by 26 publications

References 34 publications

Integrating answer set programming and constraint logic programming

Integrating answer set programming and constraint logic programming

RASP and ASP as a fragment of linear logic

A job-shop scheduling approach for optimising sugarcane rail operations

Contact Info

Product

Resources

About