Cardinality Constraint Programs

Syrjänen, Tommi

doi:10.1007/978-3-540-30227-8_18

Cited by 12 publications

(7 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[Syrjänen (2001[Syrjänen ( , 2004; Leone et al (2004);Gebser et al (2007)]). Therefore researchers have recently started to devote their attention to the study of more efficient grounding methods (see e.g.…”

Section: Groundingmentioning

confidence: 99%

Answer Set Programming for Continuous Domains: A Fuzzy Logic Approach

Janssen¹,

Schockaert²,

Vermeir³

et al. 2012

Atlantis Computational Intelligence Systems

View full text Add to dashboard Cite

Aims and scope of the seriesThe series 'Atlantis Computational Intelligence Systems' aims at covering state-of-theart research and development in all fields where computational intelligence is investigated and applied. The series seeks to publish monographs and edited volumes on foundations and new developments in the field of computational intelligence, including fundamental and applied research as well as work describing new, emerging technologies originating from computational intelligence research. Applied CI research may range from CI applications in the industry to research projects in the life sciences, including research in biology, physics, chemistry and the neurosciences.All books in this series are co-published with Springer.For more information on this series and our other book series, please visit our website at:www.atlantis-press.comPreface Answer set programming (ASP) is a form of logic programming that originated at the end of the 1980s and the beginning of the 1990s. It is especially tailored towards solving hard search problems, which it allows to encode concisely. In the past two decades it has known great success and has -among others -been applied to planning problems, musical composition, biological modeling and decision support systems for the space shuttle. Unfortunately, ASP is not very well equipped for modeling problems in continuous domains. In this book we attempt to augment ASP with the capability of expressing continuous problems by creating an answer set programming framework based on fuzzy logic. The resulting language is called fuzzy answer set programming (FASP). After two introductory chapters, also introducing the necessary technical background, we study FASP and its extensions in Chapters 3 and 4. Then we focus on the question of whether the many extensions of FASP can be compiled to a core language in Chapter 5 and succeedingly study an implementation method for a subset of FASP in Chapter 6. As such, we focus both on theoretical aspects of the language as on more practical aspects such as implementation.

show abstract

Section: Groundingmentioning

confidence: 99%

Answer Set Programming for Continuous Domains: A Fuzzy Logic Approach

Janssen¹,

Schockaert²,

Vermeir³

et al. 2012

Atlantis Computational Intelligence Systems

View full text Add to dashboard Cite

show abstract

“…, maxdepth. Though this program does not satisfy syntactic conditions, such as λ-restricted (Gebser, Schaub, & Thiele, 2007), ω-restricted (Syrjänen, 2004), or finite domain programs (Calimeri, Cozza, Ianni, & Leone, 2008), that answer set solvers usually impose in order to ensure finite grounding, the rules can still be finitely grounded by gringo Version 3.x, which does not check such syntactic conditions. 22 It is not difficult to see why the program above leads to finite grounding since we provide an explicit upper limit for the nesting depth of function do.…”

Section: Figure 2: Robby In F2lpmentioning

confidence: 99%

Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming

Lee

Palla

2012

jair

View full text Add to dashboard Cite

Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action formalisms, such as the situation calculus, the event calculus and temporal action logics; the latter has served as a basis of a family of action languages, such as language A and several of its descendants. Based on the discovery that circumscription and the stable model semantics coincide on a class of canonical formulas, we reformulate the situation calculus and the event calculus in the general theory of stable models. We also present a translation that turns the reformulations further into answer set programs, so that efficient answer set solvers can be applied to compute the situation calculus and the event calculus.

show abstract

“…These extensions have been carefully chosen to be directly and efficiently implementable in the search engine of the smodels system (Simons et al 2002). It should be stressed that the front-end of the system, lparse (Syrjänen 2001), admits a more liberal use of constraint and weight rules Syrjänen (2004) but we postpone the discussion of such features until Section 6.…”

Section: Programs In the Smodels Languagementioning

confidence: 99%

Automated Verification of Weak Equivalence within thesmodelsSystem

Janhunen¹,

Oikarinen²

2007

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

In answer set programming (ASP), a problem at hand is solved by (i) writing a logic program whose answer sets correspond to the solutions of the problem, and by (ii) computing the answer sets of the program using ananswer set solveras a search engine. Typically, a programmer creates a series of gradually improving logic programs for a particular problem when optimizing program length and execution time on a particular solver. This leads the programmer to a meta-level problem of ensuring that the programs are equivalent, i.e., they give rise to the same answer sets. To ease answer set programming at methodological level, we propose a translation-based method for verifying the equivalence of logic programs. The basic idea is to translate logic programsPandQunder consideration into a single logic program EQT(P,Q) whose answer sets (if such exist) yield counter-examples to the equivalence ofPandQ. The method is developed here in a slightly more general setting by taking thevisibilityof atoms properly into account when comparing answer sets. The translation-based approach presented in the paper has been implemented as a translator calledlpeqthat enables the verification of weak equivalence within thesmodelssystem using the same search engine as for the search of models. Our experiments withlpeqandsmodelssuggest that establishing the equivalence of logic programs in this way is in certain cases much faster than naive cross-checking of answer sets.

show abstract

Cardinality Constraint Programs

Cited by 12 publications

References 5 publications

Answer Set Programming for Continuous Domains: A Fuzzy Logic Approach

Answer Set Programming for Continuous Domains: A Fuzzy Logic Approach

Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming

Automated Verification of Weak Equivalence within thesmodelsSystem

Contact Info

Product

Resources

About