The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
Translation-based Constraint Answer Set Solving
[article]
2011
arXiv
pre-print
Preserved Fulltext
We solve constraint satisfaction problems through translation to answer set programming (ASP). ...
We have presented a translation-based approach to constraint answer set solv-ing. ...
Given a constraint logic program P over A and C, and an assignment A, a set X ⊆ A is a constraint answer set of P with respect to A iff X is an answer set of the constraint reduct [Gebser et al., 2009b ...
arXiv:1104.3927v1
fatcat:spzuleazujg7layxfsckgs3kku
A Translational Approach to Constraint Answer Set Solving
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. ...
We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. ...
constraint answer sets. ...
arXiv:1007.4114v1
fatcat:thmyx4tqgbbqpachqz3lbdx4zi
Answer Set Solving with Generalized Learned Constraints
2016
International Conference on Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Advanced in satisfiability testing, it has meanwhile become a base technology in many neighboring fields, among them answer set programming (ASP). ...
Conflict learning plays a key role in modern Boolean constraint solving. ...
I C L P 2 0 1 6 T C s 9:6 Answer Set Solving with Generalized Learned Constraints unsatisfiable. ...
doi:10.4230/oasics.iclp.2016.9
dblp:conf/iclp/GebserKKL0S16
fatcat:2t4rrxo24zbf3pv7icwvqv6wbe
A translational approach to constraint answer set solving
2010
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
AbstractWe present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. ...
We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. ...
We have presented a translation-based approach to constraint answer set solving. ...
doi:10.1017/s1471068410000220
fatcat:gtt2kevvuvfi7knbgmje2fwz7y
aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The obtained set of facts is then combined with an ASP encoding that can be grounded and solved by off-the-shelf ASP systems. ...
Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective by the award-winning sugar system. ...
:-not p(x,6). answer sets interpretation {p(x,6)} x = 6 {p(x,5),p(x,6)} x = 5 {p(x,4),p(x,5),p(x,6)} x = 4 {p(x,3),p(x,4),p(x,5),p(x,6)} x = 3 {p(x,2),p(x,3),p(x,4),p(x,5),p(x,6)} x = 2 Constraints are ...
doi:10.1007/978-3-319-23264-5_10
fatcat:kxvakstwtbf6xdv66w5ihqlbgq
Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The obtained set of facts is then combined with an ASP encoding that can be grounded and solved by off-the-shelf ASP systems. ...
Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. ...
Related Work Unlike approaches to constraint answer set solving, e.g., [10, [16] [17] [18] , which aim at integrating CSP and ASP solving (engines), the focus of aspartame lies on pure CSP solving. ...
arXiv:1312.6113v1
fatcat:nbvib4wiybdt7etpxlbezdr7iq
Towards an Integration of Answer Set and Constraint Solving
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we integrate answer set generation and constraint solving to reduce the memory requirements for a class of multi-sorted logic programs with cardinality constraints. ...
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its well-engineered and optimized ...
The algorithm that integrates answer set solving and constraint solving is formulated in terms of a generic answer set solver and a generic constraint solver. ...
doi:10.1007/11562931_7
fatcat:3pqd3d5cmnfyzmmvtkraohrhou
Integrating Answer Set Reasoning with Constraint Solving Techniques
[chapter]
Functional and Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We give brief implementation details of an algorithm computing the answer sets of programs of AC0 which does not ground constraint variables and tightly couples the "classical" ASP algorithm with an algorithm ...
The work makes it possible to solve problems which could not be solved by pure ASP or constraint solvers. ...
The ADengine combines constraint solving techniques with answer set reasoning and abduction techniques to compute simplified answer sets of P d (Π). ...
doi:10.1007/978-3-540-78969-7_4
dblp:conf/flops/MellarkodG08
fatcat:unafagcwureg5efvkvnq24yr5y
Investigating Constraint Programming and Hybrid Answer-set Solving for Industrial Test Laboratory Scheduling
2020
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we show how we can solve this problem by Answer-set Programming extended with ideas from constraint solving. ...
Wir untersuchen exakte Methoden fuer dieses Problem basierend auf Constraint Programming und Answer-set Solving. ...
CHAPTER 5
Constraint Answer-set Programming Model In this chapter we investigate a hybrid Answer-set solving approach for TLSP-S. ...
doi:10.34726/hss.2020.73541
fatcat:gmxe55qspfamllv5rggrzcx2iy
INTRODUCTION TO THE TECHNICAL COMMUNICATIONS OF THE 26TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING Swapping Evaluation: A Memory-Scalable Solution for Answer-On-Demand Tabling CHR(PRISM)-based Probabilistic Logic Learning Inference with Constrained Hidden Markov Models in PRISM A Translational Approach to Constraint Answer Set Solving
2010
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Both sets of papers were presented by their authors at this 26th ICLP. ...
The length limit for full papers was set at 15 pages plus bibliography for full papers (approximately in line with the length of TPLP technical notes) and for technical communications at 10 pages total ...
Answer Set Solving Christian Drescher, Toby Walsh A Decidable Subclass of Finitary Programs Sabrina Baselice, Piero Bonatti Transformations of Logic Programs on Infinite Lists
Alberto Pettorossi, Maurizio ...
fatcat:vi7dxqj5nrboxczt63gsrpzml4
Solve a Constraint Problem without Modeling It
2014
2014 IEEE 26th International Conference on Tools with Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Constraint acquisition systems such as Conacq or ModelSeeker are not able to solve a single instance of a problem because they require positive examples to learn. ...
It is thus able to solve a constraint problem without modeling it: we simply exit from QuAcq as soon as a complete example is classified as positive by the user. ...
A set of constraints C accepts a an assignment e Y if and only if there does not exist any constraint c ∈ C rejecting e Y . The answer to Ask(e Y ) is "yes" if and only if C T accepts e Y . ...
doi:10.1109/ictai.2014.12
dblp:conf/ictai/BessiereCL14
fatcat:ib2htv6g7vgknpmvmwfxonuvau
Answer Set Solving with Lazy Nogood Generation
2012
International Conference on Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We demonstrate the applicability of our approach in a novel Constraint Answer Set Programming system that can seamlessly integrate Constraint Programming techniques without sacrificing the advantages of ...
Although Answer Set Programming (ASP) systems are highly optimised, their performance is sensitive to the size of problem encodings. ...
Constraint Answer Set Solving via Lazy Nogood Generation One difficult task for answer set solving with Lazy Nogood Generation remains, i.e., the one of creating efficient external propagators. ...
doi:10.4230/lipics.iclp.2012.188
dblp:conf/iclp/DrescherW12
fatcat:pc3njcht3zhh5ixwm5vbhzfgtu
Itemset Mining as a Challenge Application for Answer Set Enumeration
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present an initial exploration into the possibilities of applying current state-of-the-art answer set programming (ASP) tools-esp. conflict-driven answer set enumeration-for mining itemsets in 0-1 data ...
We evaluate a simple ASP-based approach experimentally and compare it to a recently proposed framework exploiting constraint programming (CP) solvers for itemset mining. ...
In addition to the availability of black-box constraint solvers such as answer set enumerators, the additional benefit of constraint solvers is that the modeling languages enable solving novel itemset ...
doi:10.1007/978-3-642-20895-9_35
fatcat:pvjahmho65dkjd32gln55omzau
The Conflict-Driven Answer Set Solver clasp: Progress Report
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We summarize the salient features of the current version of the answer set solver clasp, focusing on the progress made since version RC4 of clasp. ...
enhanced preprocessing and search-supporting techniques, a particular emphasis lies on advanced reasoning modes, such as cautious and brave reasoning, optimization, solution projection, and incremental solving ...
Introduction The solver clasp for Answer Set Programming (ASP; [1] ) is based upon advanced Boolean constraint solving technology. ...
doi:10.1007/978-3-642-04238-6_50
fatcat:p3svekro2vfnziln2udpclsequ
Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Constraint answer set programming or CASP, for short, is a hybrid approach in automated reasoning putting together the advances of distinct research areas such as answer set programming, constraint processing ...
Systems designed to find solutions to constraint answer set programs can be grouped according to their construction into, what we call, integrational or translational approaches. ...
Acknowledgments I would like to acknowledge and cordially thank many of my collaborators with whom we had a chance to contribute to an exciting field of Constraint Answer Set Programming and many of my ...
arXiv:2107.08252v1
fatcat:czwpmcx4dja4xhdpp5cbdrhkt4
« Previous
Showing results 1 — 15 out of 463,525 results