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.
Filters
A deterministic prolog fixpoint semantics
1985
The Journal of Logic Programming
Preserved Fulltext
What we propose here is a fixpoint semantics for PROLOG that is sensitive to control as well as to logic. ...
The result is a semantics that has much in common with a deterministic imperative language semantics. We note that Francez et al. ...
doi:10.1016/0743-1066(85)90014-7
fatcat:2tn6t46ewfh3xilcdhn2wstbly
Intensional logics
1995
Science of Computer 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.
Parts III and IV of the book are concerned with propositional dynamic logic, theory of deterministic morphisms, duality of forward and reverse predicate transformers, threevalued logics, and distributive ...
An operational semantics is described, based on notions of proof trees with partial orders on rules. A family of decidable defeasible logics implemented in an extended PROLOG is described. ...
via the least fixpoint of a consequence operator TP. and an operational or proof theoretic semantics via a generalized deduction (corresponding to resolution). ...
doi:10.1016/0167-6423(95)90015-2
fatcat:brid6oph4bgtxh43wvakmby7km
Non-determinism in deductive databases
[chapter]
1991
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.
Thus, we define a construct called dynamic choice, which is consistent with the fixpoint-based semantics, cures the deficiencies of the former approach, and leads to efficient implementations in the framework ...
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. ...
As a consequence the fixpoint procedure never backtracks since the non-deterministic choices never produce a contradiction. ...
doi:10.1007/3-540-55015-1_7
fatcat:osc3wgzdx5cd7hyytvffzk5so4
Page 434 of Mathematical Reviews Vol. , Issue 87a
[page]
1987
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Fitting, Melvin (1-CUNY7)
A deterministic PROLOG fixpoint semantics.
J. Logic Programming 2 (1985), no. 2, 111-118. ...
Author summary: “We present a fixpoint semantics for PROLOG that takes into account PROLOG’s deterministic control structure as well as its logic features. ...
Page 2234 of Mathematical Reviews Vol. , Issue 91D
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The semantics of a logic program P is defined by Clark’s predicate completion of the least fixpoint of a continuous operator 7p on quasi-interpretations. ...
Summary: “Two natural ways to specify the declarative semantics of logic programs and deductive databases are the fixpoint theory of M. H. van Emden and R. Kowalski [J. Assoc. Comput. ...
Improving Lazy Non-Deterministic Computations by Demand Analysis
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 2014; you can also visit the original URL.
The file type is application/pdf.
Functional logic languages combine lazy (demand-driven) evaluation strategies from functional programming with non-deterministic computations from logic programming. ...
In order to improve the execution behavior in such situations, we propose a program analysis that guides a program transformation to avoid such inefficiencies. ...
In particular, deterministic parts of a program are much faster executed than in Prolog-based Curry implementations. ...
doi:10.4230/lipics.iclp.2012.130
dblp:conf/iclp/Hanus12
fatcat:brk5o7y5rvajrgcoiqkpnxgop4
Author Index to Volumes 1–46
2002
The Journal of Logic and Algebraic 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 2017; you can also visit the original URL.
The file type is application/pdf.
Winsborough, A confluent semantic basis for the analysis of concurrent constraint logic programs 30 (1) (1997) 53-81 Codish, M., M. Bruynooghe, M.G. de la Banda and M. ...
Taboch, A semantic basis for the termination analysis of logic programs 41 (1) (1999) 103-123 Codish, M., Worst-case groundness analysis using positive Boolean functions 41 (1) (1999) 125-128 Codish, M ...
., A Deterministic Prolog Fixpoint Semantics 2 (2) (1985) 111-118 Fitting, M., A Kripke-Kleene Semantics for Logic Programs 2 (4) (1985) 295-312 Fitting, M., Enumeration Operators and Modular Logic Programming ...
doi:10.1016/s1567-8326(01)00021-2
fatcat:ptge33wgrvcotasfgizlbzvbhu
A logical foundation for logic programming I: Biconsequence relations and nonmonotonic completion
1998
The Journal 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 2017; you can also visit the original URL.
The file type is application/pdf.
Winsborough, A confluent semantic basis for the analysis of concurrent constraint logic programs 30 (1) (1997) 53-81 Codish, M., M. Bruynooghe, M.G. de la Banda and M. ...
Taboch, A semantic basis for the termination analysis of logic programs 41 (1) (1999) 103-123 Codish, M., Worst-case groundness analysis using positive Boolean functions 41 (1) (1999) 125-128 Codish, M ...
., A Deterministic Prolog Fixpoint Semantics 2 (2) (1985) 111-118 Fitting, M., A Kripke-Kleene Semantics for Logic Programs 2 (4) (1985) 295-312 Fitting, M., Enumeration Operators and Modular Logic Programming ...
doi:10.1016/s0743-1066(97)10005-x
fatcat:ngn3u2rd2zc5jcsk5lrvpf52ge
Page 1790 of Mathematical Reviews Vol. , Issue 96c
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A fixpoint algorithm to compute the abstract semantics is then presented. ...
We define a new abstract semantics for Prolog, which incorporates the notion of reexecution, and we study its correctness and precision properties. ...
Page 5870 of Mathematical Reviews Vol. , Issue 98I
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Our motivation comes from MYCIN-like expert systems written in Prolog with an uncertainty reasoning mechanism. Our declarative semantics is based on a generaliza- tion of P. ...
Kunen had already shown that every such program has at least one total fixpoint, but the well-founded semantics is not guaranteed to yield one of them. ...
Page 1658 of Mathematical Reviews Vol. , Issue 94c
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Several problems of practical interest are examined, such as checking (statically or dynamically) if a given program is deterministic, detecting co- incidence of deterministic and nondeterministic semantics ...
The first consists of extensions of Datalog with negations in bodies and/or heads of rules, with nondetermin- istic fixpoint semantics. ...
Semantics for Prolog with Cut – Revisited
[chapter]
2014
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.
This paper revisits the semantics for Prolog with cut from the perspective of formulating a semantic base that is amenable to abstract interpretation. ...
It also shows how to replace prefix ordering, that is classically used in these semantics, with a domain that is setup for abstraction, whilst simultaneously retaining a fixpoint construction, albeit one ...
Denotational Semantics for Prolog with cut Now we are in a position to define the semantics of a cut-stratified Prolog programs as the stratified fixpoint of the sequence of growing functions induced by ...
doi:10.1007/978-3-319-07151-0_17
fatcat:w3nyy24hc5f5neiuf63ft2jxme
Answer Set Programming with Constraints Using Lazy Grounding
[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.
The proposed approach relies on a bottom-up computation that does not require a preliminary grounding phase. ...
The paper describes a novel methodology to compute stable models in Answer Set Programming. ...
In the second case, the idea of alternating fixpoint [25] is coded in Prolog. ...
doi:10.1007/978-3-642-02846-5_14
fatcat:un4m2ygbr5ardftbzc535eggya
Page 5101 of Mathematical Reviews Vol. , Issue 93i
[page]
1993
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In order to explain these observations, we present a precise operational semantics for rewrite programs, define their denotational (fixpoint) semantics, prove the equivalence of operational, model theoretic ...
5101
spect to the type preorder, given a unique type for each variable occurring in the term, and (iii) there is a deterministic type check- ing algorithm for expressions. John C. ...
Page 4496 of Mathematical Reviews Vol. , Issue 97G
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We formalize the imple- mentation of a deterministic partial E-unification algorithm on a deterministic abstract machine, called the twin unification ma- chine. ...
Summary: “We first introduce a general semantic scheme for logic programs which provides a uniform framework for defining dif- ferent compositional semantics parametrically with respect to a given notion ...
« Previous
Showing results 1 — 15 out of 581 results