AbstractA fixpoint semantics for PROLOG is presented that takes into account PROLOG's deterministic control structure as well as its logic features. It is applied to prove the correctness of a prime-number program based on the sieve of Eratosthenes, a program whose behavior depends critically on the sequential nature of PROLOG
Many abstract interpretation frameworks and analyses for Prolog have been proposed, which seek to ex...
AbstractThe paper provides a mathematical yet simple model for the full programming language Prolog,...
AbstractFor reasons of efficiency, in almost all implementations of Prolog the occur check is left o...
AbstractA fixpoint semantics for PROLOG is presented that takes into account PROLOG's deterministic ...
AbstractIn this paper, we define a framework in which the termination of Prolog programs can be prov...
We present a Prolog program - the SAT solver of Howe and King - as a (pure) logic program with added...
Abstract. At PEPM’91 Sahlin presented a determinacy analysis for Prolog with cut. The analysis was, ...
AbstractThe variety of semantical approaches that have been invented for logic programs is quite bro...
Abstract. In program development it is useful to know that a call to a Prolog program will not inadv...
AbstractWe use the notions of closures and fair chaotic iterations to give a semantics to logic prog...
AbstractThe coincidence of the declarative and procedural interpretations of logic programs does not...
AbstractThis paper introduces extended programs and extended goals for logic programming. A clause i...
We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control....
AbstractThis paper proposes to specify semantic definitions for logic programming languages such as ...
AbstractMints (1986) has given a deductive calculus, a set of proof rules, for pure Prolog such that...
Many abstract interpretation frameworks and analyses for Prolog have been proposed, which seek to ex...
AbstractThe paper provides a mathematical yet simple model for the full programming language Prolog,...
AbstractFor reasons of efficiency, in almost all implementations of Prolog the occur check is left o...
AbstractA fixpoint semantics for PROLOG is presented that takes into account PROLOG's deterministic ...
AbstractIn this paper, we define a framework in which the termination of Prolog programs can be prov...
We present a Prolog program - the SAT solver of Howe and King - as a (pure) logic program with added...
Abstract. At PEPM’91 Sahlin presented a determinacy analysis for Prolog with cut. The analysis was, ...
AbstractThe variety of semantical approaches that have been invented for logic programs is quite bro...
Abstract. In program development it is useful to know that a call to a Prolog program will not inadv...
AbstractWe use the notions of closures and fair chaotic iterations to give a semantics to logic prog...
AbstractThe coincidence of the declarative and procedural interpretations of logic programs does not...
AbstractThis paper introduces extended programs and extended goals for logic programming. A clause i...
We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control....
AbstractThis paper proposes to specify semantic definitions for logic programming languages such as ...
AbstractMints (1986) has given a deductive calculus, a set of proof rules, for pure Prolog such that...
Many abstract interpretation frameworks and analyses for Prolog have been proposed, which seek to ex...
AbstractThe paper provides a mathematical yet simple model for the full programming language Prolog,...
AbstractFor reasons of efficiency, in almost all implementations of Prolog the occur check is left o...
DOI
Add to ORKG