66,186 Hits in 7.4 sec

Computing Stable Models of Normal Logic Programs Without Grounding [article]

Kyle Marple, Elmer Salazar, Gopal Gupta
2017 arXiv   pre-print
We present a method for computing stable models of normal logic programs, i.e., logic programs extended with negation, in the presence of predicates with arbitrary terms.  ...  Using our method, a normal logic program with predicates can be executed directly under the stable model semantics without requiring it to be grounded either before or during execution and without requiring  ...  Acknowledgment We are grateful to Howard Blair for his help and input, particularly on the subject of completeness.  ... 
arXiv:1709.00501v1 fatcat:z7iqnkdvzvhfxeex7z2f3odmfa

Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system

Robert E. Mercer, Vincent Risch
2003 Answer Set Programming  
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic programming, and a restricted  ...  A procedure to compute stable models (resp. answer sets, extensions) by enumerating maximal cliques with intelligent pruning is sketched.  ...  Acknowledgements A number of people have helped push these ideas.  ... 
dblp:conf/asp/MercerR03 fatcat:w7kdlzgpkvg5tfieep5hehyrlm

Computing abduction by using TMS with top-down expectation

Noboru Iwayama, Ken Satoh
2000 The Journal of Logic Programming  
Then, we show a bottom-up procedure to compute stable models for a normal logic program with integrity constraints.  ...  We translate an abductive framework into a normal logic program with integrity constraints and show the correspondence between generalized stable models and stable models for the translation of the abductive  ...  This work was part of the Ph.D. program of Noboru Iwayama at Nagoya University.  ... 
doi:10.1016/s0743-1066(99)00076-x fatcat:wc4vadf7r5d7tb3byam7gkxpla

Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems

Ilkka Niemelä
2011 2011 41st IEEE International Symposium on Multiple-Valued Logic  
It is NP-complete to decide whether a ground program has a stable model. Normal programs (without function symbols) give a uniform encoding to every NP search problem.  ...  A stratified program (no recursion through negation) has a unique stable model (canonical model). It is linear time to check whether a set of atoms is a stable model of a ground program.  ...  . % Minimize the number of classB papers minimize [ assignedB(P,R):paper(P):reviewer(R) ]. Part IV ASP Solver Technology Part V Systems, Applications, Literature  ... 
doi:10.1109/ismvl.2011.61 dblp:conf/ismvl/Niemela11 fatcat:evdlcs7bobg6dp25oovr6egv5a

Computing non-ground representations of stable models [chapter]

Thomas Eiter, James Lu, V. S. Subrahmanian
1997 Lecture Notes in Computer Science  
As a practical consequence, the well-founded model (or the set of stable models) may be partially pre-computed at compile-time, resulting in the association of each predicate symbol in the program to a  ...  A set of constrained atoms is a constrained interpretation. We show how non-ground representations of both the stable model and the well-founded semantics may be obtained through Turi's approach.  ...  In partiuclar, a referee pointed out that related work on computing non-ground well-founded semantics has been done by C. Damásio in his PhD thesis (1996, unpublished).  ... 
doi:10.1007/3-540-63255-7_14 fatcat:w5ga3kgprrfv7g6l22d5prgztq

The Structure and Complexity of Credal Semantics

Fábio Gagliardi Cozman, Denis Deratani Mauá
2016 International Conference on Inductive Logic Programming  
A flexible semantics has been proposed by Lukasiewicz for probabilistic logic programs where we have a normal logic program augmented with a set of independent probabilistic facts.  ...  That semantics, which we call credal semantics, is the set of all probability measures (over stable models) that are consistent with a total choice of probabilistic facts.  ...  Programs without not are definite. An atom is ground if it does not contain any logical variable; a program without logical variables is propositional.  ... 
dblp:conf/ilp/CozmanM16 fatcat:7ffs7felwzd6bjtdt2zwwq46ku

Page 8878 of Mathematical Reviews Vol. , Issue 2000m [page]

2000 Mathematical Reviews  
Summary: “Logic programming with the stable model seman- tics is put forward as a novel constraint programming paradigm.  ...  In particular, we consider normal open logic programs in full generality, without some usual restrictions considered in previous approaches: in our case, Q-union is defined allowing the closure of some  ... 

A fixpoint characterization of abductive logic programs

Katsumi Inoue, Chiaki Sakama
1996 The Journal of Logic Programming  
Eshghi and Kowalski [8] give an abductive interpretation of negation as failure [3] in the class of normal logic programs, and show a 1-1 correspondence between the stable models [13] of a normal logic  ...  A new fixpoint semantics for abductive logic programs is provided, in which the belief models of an abductive program are characterized as the fixpoint of a disjunctive program obtained by a suitable program  ...  Fixpoint Semantics for Normal Logic Programs To characterize the stable models of a normal logic program, Inoue et al.  ... 
doi:10.1016/0743-1066(95)00119-0 fatcat:hoq2n3pjnneslc3bbl7iwta7ju

Some Properties of Inverse Resolution in Normal Logic Programs [chapter]

Chiaki Sakama
1999 Lecture Notes in Computer Science  
The V-operators may turn a consistent normal logic program into inconsistent under both the stable model semantics and the completion semantics.  ...  This paper studies the properties of inverse resolution in normal logic programs. The V-operators are known as operations for inductive generalization in definite logic programs.  ...  Acknowledgements The author thanks Katsumi Inoue for comments on an earlier draft of this paper.  ... 
doi:10.1007/3-540-48751-4_26 fatcat:4dfel367arb3zormwroh64juwu

Extending Prolog with nonmonotonic reasoning

Weidong Chen
1996 The Journal of Logic Programming  
model for normal logic programs [25] .  ...  Again we focus on stable models of residual programs of queries. Our approach to skeptical reasoning is as follows. Let P be a normal logic program and let Q be a ground atom.  ... 
doi:10.1016/0743-1066(95)00151-4 fatcat:qxjtfwogargabg235cf4upjfyq

Possibilistic uncertainty handling for answer set programming

Pascal Nicolas, Laurent Garcia, Igor Stéphan, Claire Lefèvre
2006 Annals of Mathematics and Artificial Intelligence  
In order to take into account a certainty level associated to each piece of knowledge, we use possibility theory to extend the non monotonic semantics of stable models for logic programs with default negation  ...  By means of a possibility distribution we define a clear semantics of such programs by introducing what is a possibilistic stable model.  ...  Possibilistic stable model computation Here, we describe how our system posSmodels computes the possibilistic stable models of a possibilistic normal logic program by using the grounded normal logic program  ... 
doi:10.1007/s10472-006-9029-y fatcat:schtv2wkfbe77mo5gmfohpr4qe

Smodels: A System for Answer Set Programming [article]

Ilkka Niemela, Patrik Simons, Tommi Syrjanen
2000 arXiv   pre-print
The Smodels system implements the stable model semantics for normal logic programs.  ...  On top of this core engine more involved systems can be built. As an example, we have implemented total and partial stable model computation for disjunctive logic programs.  ...  We have applications where programs with hundreds of thousands of non-trivial ground rules are treated efficiently, see e.g. Heljanko 1999b) .  ... 
arXiv:cs/0003033v1 fatcat:3zmgjf3uknhhdnxhr5nzg67nlu

Possibilistic Stable Model Computing

Pascal Nicolas, Claire Lefèvre
2005 Answer Set Programming  
In this work we explain how we can compute the possibilistic stable models of a possibilistic normal logic program by using available softwares for Answer Set Programming and we describe the main lines  ...  To achieve this aim, knowledge is represented by a normal logic program where each rule is given with its own degree of certainty.  ...  Possibilistic Stable model Computation Here, we describe how we compute the p.s.m. of a p.n.l.p. by using the grounded normal logic program produced by the preprocessing step described in previous subsection  ... 
dblp:conf/asp/NicolasL05 fatcat:u7fy3vw27rboriph3tgjmk5224

Computing Diverse Optimal Stable Models

Javier Romero, Torsten Schaub, Philipp Wanko, Marc Herbstritt
2016 International Conference on Logic Programming  
We introduce a comprehensive framework for computing diverse (or similar) solutions to logic programs with preferences.  ...  Apart from proposing several new methods, it also accommodates existing ones and generalizes them to programs with preferences.  ...  Discussion We presented a comprehensive framework for computing diverse (or similar) solutions to logic programs with generic preferences and implemented it in asprin 2, available at [1].  ... 
doi:10.4230/oasics.iclp.2016.3 dblp:conf/iclp/0003SW16 fatcat:7e7wfbkl2jbxrldciicnxkhuda

Semantics of (disjunctive) logic programs based on partial evaluation

Stefan Brass, Jürgen Dix
1999 The Journal of Logic Programming  
We present a new and general approach for defining, understanding, and computing logic programming semantics.  ...  We consider disjunctive programs for generality, but our results are still interesting if speciahzed to normal programs.  ...  Of course, we still have to compute the stable models of the residual program.  ... 
doi:10.1016/s0743-1066(98)10030-4 fatcat:3ttrlcww4zebrbkpvbnrfyckni
« Previous Showing results 1 — 15 out of 66,186 results