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
AbstractThe variety of semantical approaches that have been invented for logic programs is quite bro...
Centre for Intelligent Systems and their ApplicationsThe coneptual distinction between logic and co...
van Gelder's alternating fixpoint theory has proven to be a very useful tool for unifying and charac...
AbstractA fixpoint semantics for PROLOG is presented that takes into account PROLOG's deterministic ...
Abstract. At PEPM’91 Sahlin presented a determinacy analysis for Prolog with cut. The analysis was, ...
Abstract. In program development it is useful to know that a call to a Prolog program will not inadv...
AbstractIn this paper, we define a framework in which the termination of Prolog programs can be prov...
In this paper, we first review a bottom-up abstract interpretation framework for finite approximatio...
AbstractThis paper proposes to specify semantic definitions for logic programming languages such as ...
We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control....
This paper proposes to specify semantic definitions for logic programming languages such as Prolog i...
The goal of this paper is to construct a semantic basis for the abstract interpretation of Prolog pr...
The fixpoint completion fix (P) of a normal logic program P is a program transformation such that th...
The goal of this paper is to construct a semantic basis for the abstract interpretaion of Prolog pro...
Many abstract interpretation frameworks and analyses for Prolog have been proposed, which seek to ex...
AbstractThe variety of semantical approaches that have been invented for logic programs is quite bro...
Centre for Intelligent Systems and their ApplicationsThe coneptual distinction between logic and co...
van Gelder's alternating fixpoint theory has proven to be a very useful tool for unifying and charac...
AbstractA fixpoint semantics for PROLOG is presented that takes into account PROLOG's deterministic ...
Abstract. At PEPM’91 Sahlin presented a determinacy analysis for Prolog with cut. The analysis was, ...
Abstract. In program development it is useful to know that a call to a Prolog program will not inadv...
AbstractIn this paper, we define a framework in which the termination of Prolog programs can be prov...
In this paper, we first review a bottom-up abstract interpretation framework for finite approximatio...
AbstractThis paper proposes to specify semantic definitions for logic programming languages such as ...
We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control....
This paper proposes to specify semantic definitions for logic programming languages such as Prolog i...
The goal of this paper is to construct a semantic basis for the abstract interpretation of Prolog pr...
The fixpoint completion fix (P) of a normal logic program P is a program transformation such that th...
The goal of this paper is to construct a semantic basis for the abstract interpretaion of Prolog pro...
Many abstract interpretation frameworks and analyses for Prolog have been proposed, which seek to ex...
AbstractThe variety of semantical approaches that have been invented for logic programs is quite bro...
Centre for Intelligent Systems and their ApplicationsThe coneptual distinction between logic and co...
van Gelder's alternating fixpoint theory has proven to be a very useful tool for unifying and charac...
DOI
Add to ORKG