Filters








34,602 Hits in 6.2 sec

Page 2400 of Mathematical Reviews Vol. , Issue 96d [page]

1996 Mathematical Reviews  
Summary: “We study the expressive powers of two semantics for deductive databases and logic programming: the well-founded se- mantics and the stable semantics.  ...  We compare them especially to two older semantics, the two-valued and three-valued program completion semantics.  ... 

Nested Epistemic Logic Programs [chapter]

Kewen Wang, Yan Zhang
2005 Lecture Notes in Computer Science  
Therefore, our work establishes a unifying framework for both nested logic programs and epistemic logic programs.  ...  Furthermore, we also provide a characterization of the strong equivalence of two nested epistemic logic programs.  ...  The authors would like to thank the three referees for their comments. In particular, the comments from one referee greatly helped the improvement of the paper.  ... 
doi:10.1007/11546207_22 fatcat:l6sk5734xbcgxfyn4obago72r4

Fixpoint semantics for logic programming a survey

Melvin Fitting
2002 Theoretical Computer Science  
Nonetheless, much of the work on logic programming semantics seems to exist side by side with similar work done for imperative and functional programming, with relatively minimal contact between communities  ...  The variety of semantical approaches that have been invented for logic programs is quite broad, drawing on classical and many-valued logic, lattice theory, game theory, and topology.  ...  Acknowledgement I want to thank Howard Blair for a number of suggestions that improved the presentation in this paper.  ... 
doi:10.1016/s0304-3975(00)00330-3 fatcat:ec6vntnnu5eoflpgohb3qz5ylm

Page 400 of Mathematical Reviews Vol. , Issue 93a [page]

1993 Mathematical Reviews  
“The purpose of this report is to define a declarative semantics for every logic program using the negation as failure rule. It shows that SLDNF-provability is a modal notion.  ...  We show that the comtrace model provides an invariant semantics for such nets and is in full agreement with their operational semantics expressed in terms of step sequences.  ... 

Editorial

Hélène Kirchner, Wolfgang Wechler
1992 Theoretical Computer Science  
The second step can be viewed as compiling the steps of constructive negation into a definite clause program.  ...  This paper is concerned with the pure logical approach, and its specific interest lies in the relationship between the two most successful approaches to the semantics of negation in logic programming.  ... 
doi:10.1016/0304-3975(92)90283-l fatcat:nb6jl2blyrfg3pkdq6yrch5wwi

A fixpoint semantics for disjunctive logic programs

Jack Minker, Arcot Rajasekar
1990 The Journal of Logic Programming  
For logic programs two such definitions apply: procedural semantics and declarative semantics. Both of these semantics deal with positive consequences and theories of negation.  ...  D We present a fixpoint semantics for disjunctive logic programs.  ...  SLD resolution for a Horn program. The SLINF inference system for handlmg negation reduces to the SLDNF inference system for Horn programs.  ... 
doi:10.1016/0743-1066(90)90033-2 fatcat:wbwwds7mprgb3m7kfnvslef3ci

Page 6357 of Mathematical Reviews Vol. , Issue 97J [page]

1997 Mathematical Reviews  
Summary: “This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation.  ...  Logic Comput. 7 (1997), no. 1, 1-38. Summary: “We develop a denotational, fully abstract semantics for constraint logic programming (clp) with respect to successful and failed observables.  ... 

Tight, consistent, and computable completions for unrestricted logic programs

Mark Wallace
1993 The Journal of Logic Programming  
P has a two-valued well-founded model M (which is also its unique stable model). Therefore, D(P) also has a well-founded model DM such that DM I L, = M.  ...  If P is locally stratified, then comp(R(P)) has a unique Herbrand model RM; and RM ( L, is the unique stable model of P, and correspondingly, the two-valued well-founded model of P. PROOF.  ...  In this paper, we seek to introduce logical semantics for unrestricted logic programming with negation. We propose a tight logical semantics corresponding to the fixpoint semantics of [31] .  ... 
doi:10.1016/0743-1066(93)90041-e fatcat:h5wrtir4djbm7io5dsgrixhb7i

Transforming normal logic programs to constraint logic programs

Kanchana Kanchanasut, Peter J. Stuckey
1992 Theoretical Computer Science  
We show that for a class of programs where every negative subgoal can be expanded, the resultant program R' is a definite logic program with equality and disequality constraints.  ...  The completed predicate definitions in P'", if they do not contain local variables, can be used as a basis for expanding each negated atom in the bodies of P"'.  ...  The well-founded semantics coincides with the stable model semantics for cases where programs have two-valued well-founded models.  ... 
doi:10.1016/0304-3975(92)90286-o fatcat:m4iyrlortzeexjs7d7wiwukwcy

Knowledge Representation Using High-Level Non-monotonic Reasoning [chapter]

Mauricio Osorio, Juan Carlos Nieves, Fernando Zacarias, Erika Saucedo
2000 Lecture Notes in Computer Science  
We show how these concepts are integrated in a natural way into the standard logic programming framework.  ...  For this purpose, we present several well known examples from the literature that motivate the need of this new paradigm. Finally, we define a declarative semantics for HLNM reasoning.  ...  With respect to default negation, it is well known that the stable semantics and the well founded semantics (WFS) are the two most acceptable definitions of this form of negation in Logic Programming.  ... 
doi:10.1007/10720076_2 fatcat:pj4ezi3hsrdoje52erbbzkhtmq

Page 4999 of Mathematical Reviews Vol. , Issue 96h [page]

1996 Mathematical Reviews  
Logic Programming 25 (1995), no. 2, 93-117. Summary: “We introduce a new operational semantics, SLDR- resolution, for a class of recursive logic programs.  ...  In other words, does this answer sit well with the known “semantics” of logic programs?  ... 

The valid model semantics for logic programs

Catriel Beeri, Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
1992 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '92  
We present the valid model semantics, a new approach to providing semantics for logic programs with negation, setterms and grouping.  ...  The valid model semantics also gives meaning to the generation and use of non-ground facts (i.e., facts with variables) in a computation.  ...  We compare the valid model semantics with several earlier semantics for logic programs with negation, and logic programs that use aggregate operations on relations.  ... 
doi:10.1145/137097.137115 dblp:conf/pods/BeeriRSS92 fatcat:777opvrcvvgbha2ubcuaddfmym

A paraconsistent semantics with contradiction support detection [chapter]

Carlos Viegas Damásio, Luís Moniz Pereira
1997 Lecture Notes in Computer Science  
Afterwards, we show how to implement two recent modal contradiction related constructs in the language of extended logic programs in order to gain explicit control of contradiction propagation.  ...  Default Most semantics for extended logic programs view default negation and explicit negation as unrelated.  ...  These two kinds of reasoning have been proposed in 40]. This three-valued framework for paraconsistent logic programs includes a form of explicit negation, default negation, and disjunction.  ... 
doi:10.1007/3-540-63255-7_18 fatcat:sxakliqjwrdvxelmeoelp77nvu

A unifying view for logic programming with non-monotonic reasoning

Antonio Brogi, Evelina Lamma, Paolo Mancarella, Paola Mello
1997 Theoretical Computer Science  
We provide a simple formulation of a framework where some extensions of logic programming with non-monotonic reasoning are treated uniformly, namely, two kinds of negation and abduction.  ...  Moreover, it embeds and generalizes some existing semantics which deal with negation and abduction. The framework is equipped with a correct top-down proof procedure.  ...  Acknowledgements We thank the anonymous referees for their useful and pertinent comments on the first version of this paper. This work has been partially supported by MURST 40% Project.  ... 
doi:10.1016/s0304-3975(97)80755-4 fatcat:7xvy72jhizeybildnx7w35ysqa

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

2000 Mathematical Reviews  
For a program with vari- 68 COMPUTER SCIENCE 8878 ables these methods need a grounding procedure for generating a variable-free program.  ...  {For the entire collection see MR 2000k:68010.} 2000m:68045 68N17 68T20 Niemela, Ilkka (FIN-HUT-CEN; Espoo) Logic programs with stable model semantics as a constraint programming paradigm.  ... 
« Previous Showing results 1 — 15 out of 34,602 results