Ilkka Niemel. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3-- 4):241--273, 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....computing the transitive closure of the connection graph. The dependency checking combined with the ordering of inputs seems to payo in most of the cases. 5 Stable model programming A new, and growing in importance, logic programming paradigm is that of Stable Models (or Answer set) Programming [12, 13], for which several implementations already exist [14, 6] In it, solutions to a problem are represented by the stable models [9] of the corresponding program, rather than by answer substitutions of a single model of the program, as in traditional logic programming. In traditional logic ....

I. Niemela. Logic programs with stable model semantics as a constraint programming paradigm. In Computational Aspects of Nonmonotonic Reasoning, 1998.

.... Set Programming Computationally, the operation of CCalc as a planner is a form of satis ability planning [ Kautz and Selman, 1992 ] Since causal theories are closely related to logic programs, it can be also viewed as a form of answer set programming [ Marek and Truszczy nski, 1999 ] Niemel a, 1999 ] applied to plan generation [ Dimopoulos et al. 1997 ] Lifschitz, 2002 ] Since CCalc employs satis ability solvers for search, its operation is particularly close to the operation of the answer set solver cmodels. 8 Proofs of Theorems only if, for every formula F , Proof I is a ....

Ilkka Niemela. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Arti cial Intelligence, 25:241-273, 1999.

....phylogenetic networks can be obtained from it by adding a small number of new edges. This paper addresses the same computational problem computing a small set of additional edges that turn a given phylogeny into a perfect phylogenetic network. To solve this problem, we use answer set programming [6, 8, 3] a new form of declarative programming based on answer sets (or stable models) 1, 2] The idea of answer set programming is to represent a computational problem as a logic program whose answer sets correspond to solutions to the given problem. There are systems speci cally designed to compute ....

Ilkka Niemela. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Arti cial Intelligence, 25:241{ 273, 1999.

....networks can be obtained from it by adding a small number of new edges. This paper addresses the same computational problem computing a small set of additional edges that turn a given phylogeny into a perfect phylogenetic network. To solve this problem, we use answer set programming [6] [8], 3] a new form of declarative programming based on answer sets (or stable models) 1] 2] The idea of answer set programming is to represent a computational problem as a logic program whose answer sets correspond to solutions to the given problem. There are systems speci cally designed to ....

Ilkka Niemela. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Arti cial Intelligence, 25:241{ 273, 1999.

....of general or The list operator [ in a classical example. 15 speci c domain methods. The goal of constraint programming is to solve constraint satisfaction problems, i.e. nite set of relations over a certain domain. Logic Programming with Stable Model Semantics (LPSM , according to [19]) merges the advantages of the logic programming knowledge representation with constraint programming. This amalgam seems to be useful in reasoning about combinatorial problems, which frequently emerge on the computational scene. The stable models semantics does not t into the standard paradigm ....

....tool box is used for model checking purposes; Eciency smodels is based upon a bottom up backtracking algorithm that drastically prunes the search space. This algorithm is based on an approximation technique for stable model semantics and presents strong connections with well founded semantics [19]; Time complexity smodels has a quadratic time algorithm for checking whether a set of atoms S is the well founded stable model of a ground logic program. 22 Space complexity smodels runs in linear space. These properties open the possibility of using the stable model semantics in areas where ....

[Article contains additional citation context not shown here]

I. Niemela. Logic programs with stable model semantics as a constraint programming paradigm. In Workshop on Computational Aspects of Nonmonotonic Reasoning, Trento, Italy, June 1998.

....alternative style of logic programming: each solution to a problem is represented by an answer set of a function free logic program encoding the problem itself. Several implementations now exist for stable logic programming, and their performance is rapidly improving; among them are smodels [Sim97,NieSim98], DeReS [ChoMarTru96] SLG [CheWar96] dlv [ELMPS97] and CCalc [McCTur97] Recently, Lifschitz has introduced [Lif99] the term Answer set planning to describe which axioms are needed to characterize correct plans and to discuss the applicability of stable model (answer set) computation ....

Niemela I. and Simons P., 1998. Logic programs with stable model semantics as a constraint programming paradigm. Proc. of NM'98 workshop. Extended version submitted for publication.

....and negation as failure such that its answer sets represent the solutions of the problem. In stable logic programming [25] experts encode the problem by a logic program of which the stable models represent the solutions. Recently, the implementation of an ecient stable model generator SMODELS [31] allowed a number of very promising computational experiments in these paradigms. Answer set programs can be easily transformed into logic programs without classical negation. The discussion below focuses on stable logic programming. In this paradigm, logic programming is standardly viewed as a ....

....Stable models encode possible states of the world rather than atom belief sets. In [25] stable logic programs are presented for solving graph problems such as computing Hamiltonian paths and kernels of a graph. Each stable model represents a di erent Hamiltonian path, respectively a kernel. In [31] and [19] stable logic programs and answer set programs are presented to solve planning problems. In the context of the planning problem, a logic program describes e ects of actions, preconditions of actions, initial state and goal state. The stable models represent a plan, i.e. a sequence of ....

I. Niemela. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Articial Intelligence, 25:241-273, 1999. 23

.... is based on an approximation technique for stable models which is closely related to the well founded semantics [NS97] An interesting programming technique, based on using characteristics of the stable model semantics as a framework for constraint programming, has been developed for smodels [Nie98]. This has been applied in several application domains [Nie00] which has shown smodels to be, arguably, the most successful stable models engine. These applications include, but are not restricted to model 7 checking [LRS98] feature interaction [AAdR99] logical cryptanalysis [HMN00] and ....

I. Niemela. Logic programs with stable model semantics as a constraint programming paradigm. In Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, Trento, Italy, May 30 - June 1 1998.

No context found.

Ilkka Niemel. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3-- 4):241--273, 1999.

No context found.

Ilkka Niemel. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3-- 4):241--273, 1999.

No context found.

I. Niemel. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Math. and AI, 25(34):241273, 1999.

No context found.

I. Niemel. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Articial Intelligence, 25(3,4):241273, 1999.

No context found.

Niemel a, I. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3,4, 241--273, 1999

No context found.

Niemel, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25((3-4)):241--273.

No context found.

Niemel I. Logic Programs with Stable Model Semantics as a Constraint programming Paradigm. Annals of Mathematics and Articial Intelligence, 25(3,4), pp. 241273. 1999.

No context found.

I. Niemel. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241--273, 1999.

No context found.

I. Niemel. Logic programs with stable model semantics as a constraint programming paradigm. In Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72--79, 1998.

No context found.

I. Niemel. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Articial Intelligence, 25(3,4):241273, 1999.

No context found.

Ilkka Niemel. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3--4):241--273, 1999.

No context found.

I. Niemela. Logic programs with stable model semantics as a constraint programming paradigm. In Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72-79. Helsinki University of Technology, Digital Systems Laboratory, Research Report A52, May 1998.

No context found.

I. Niemel. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241--273, 1999.

No context found.

I. Niemel a. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and AI, 25(3-4):241--273, 1999.

No context found.

I. Niemela, Logic programs with stable model semantics as a constraint programming paradigm, Annals of Mathematics and Arti cial Intelligence, 25(3,4):241-273, 1999.

No context found.

I. Niemel. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Articial Intelligence, 25(3,4):241273, 1999.

No context found.

Ilkka Niemela. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Arti cial Intelligence, 25:241-273, 1999.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC