Oracle Semantics for Prolog

No abstract is available for this paper.

• Publication year

  1992

• Venue

  Information and Computation

• Publication date

  1992-09-02

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1006/inco.1995.1146
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Algebraic and Logic Programming

  1996cited by this paper
• Termination of Logic Programs: The Never-Ending Story

  1994cited by this paper
• Constraint Logic Programming: A Survey

  1994cited by this paper
• Experimental evaluation of a generic abstract interpretation algorithm for PROLOG

  1994cited by this paper
• A Compositional Semantics for Logic Programs

  1994cited by this paper
• Reasoning about Termination of Pure Prolog Programs

  1993cited by this paper
• A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs

  1993cited by this paper
• A general framework for semantics-based bottom-up abstract interpretation of logic programs

  1993cited by this paper
• Automatic complexity analysis of logic problems

  1993cited by this paper
• Algebraic and logic programming : third international conference, Pisa, Italy, September 1992: proceedings

  1992cited by this paper
• Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patterns

  1992cited by this paper
• Contributions to the Semantics of Open Logic Programs

  1992influential reference
• A Bottom-Up Polymorphic Type Inference in Logic Programming

  1992cited by this paper
• Modelling Prolog control

  1992influential reference
• Implementation of Subset-Equational Programs

  1992cited by this paper
• Bottum-up abstract interpretation of logic programs

  1992cited by this paper
• The CLP( ℛ ) language and system

  1992cited by this paper
• Proving Termination of General Prolog Programs

  1991cited by this paper
• Proving Program Properties by Means of SLS-Resolution

  1991cited by this paper
• Replay, recovery, replication, and snapshots of nondeterministic concurrent programs

  1991cited by this paper
• A Practical Framework for the Abstract Interpretation of Logic Programs

  1991cited by this paper
• Automatic Complexity Analysis of Logic Programs

  1991cited by this paper
• Deriving Termination Proofs for Logic Programs, Using Abstract Procedures

  1991cited by this paper
• Proceedings of the eighth international conference on Logic programming

  1991cited by this paper
• Finite Failures and Partial Computations in Concurrent Logic Languages

  1990cited by this paper
• Kernel Andorra Prolog and its Computation Model

  1990cited by this paper
• Studies in Pure Prolog: Termination

  1990cited by this paper
• A Logical Operational Semantics of Full Prolog, Part II: Built-in Predicates for Database Manipulation

  1990cited by this paper
• Algebraic Properties of Idempotent Substitutions

  1990cited by this paper
• Functional computations in logic programs

  1989cited by this paper
• Inference of Polymorphic Types for Logic Programs

  1989cited by this paper
• Declarative Modeling of the Operational Behavior of Logic Languages

  1989cited by this paper
• Concurrent constraint programming

  1989cited by this paper
• EqL: The Language and Its Implementation

  1989cited by this paper
• On the Safe Termination of PROLOG Programs

  1989cited by this paper
• A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control

  1989cited by this paper
• Continuation Semantics for PROLOG with Cut

  1989cited by this paper
• Fully abstract compositional semantics for logic programs

  1989cited by this paper
• Polymorphic Type Inference in Prolog by Abstract Interpretation

  1988cited by this paper
• Detecting stable properties of networks in concurrent logic programming languages

  1988cited by this paper
• Models, Unfolding Rules and Fixpoint Semantics

  1988cited by this paper
• Denotational and Operational Semantics for Prolog

  1988cited by this paper
• Introduction to Logic Programming

  1988cited by this paper
• Foundations of logic programming; (2nd extended ed.)

  1987cited by this paper
• Constraint logic programming

  1987cited by this paper
• Operational and Denotational Semantics of Prolog

  1987cited by this paper
• Characterisation of Terminating Logic Programs

  1986cited by this paper
• Controlling Recursive Inference

  1986cited by this paper
• Negation and Control in Prolog

  1986cited by this paper
• Foundations of Logic Programming

  1984cited by this paper
• Stepwise Development of Operational and Denotational Semantics for Prolog

  1984cited by this paper
• Properties of Substitutions and Unifications

  1983cited by this paper
• The Evaluation of Expressions in Icon

  1982cited by this paper
• Contributions to the Theory of Logic Programming

  1982cited by this paper
• The Semantics of Predicate Logic as a Programming Language

  1976cited by this paper
• The SNOBOL4 programming language

  1968cited by this paper

• C URRICULUM V ITÆ

  2021cites this paper
• A lemma on closures and its application to modularity in logic programming semantics

  2020cites this paper
• Theoretical Foundations and Semantics of Logic Programming

  2010cites this paper
• Abstract interpretation of resolution-based semantics

  2009cites this paper
• S-semantics for logic programming: A retrospective look

  2009cites this paper
• Goal-independent Semantics for Path Dependent Analysis of Prolog Programs

  2007cites this paper
• Goal-independent Semantics for Path Dependent Analysis of Prolog Programs

  2007cites this paper
• Programming towards a Logical Semantics for Pure Prolog'

  2003cites this paper
• Abstract Interpretation of Prolog Programs

  1999cites this paper
• Towards a Logical Semantics for Pure Prolog

  1998cites this paper
• Lower-bound Time-complexity Analysis of Logic Programs

  1997influential citation
• Algebraic computational models of OR-parallel execution of Prolog

  1997cites this paper
• A Denotational Semantics for Prolog

  1997cites this paper
• "Optimal" Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics

  1996cites this paper
• Resultants Semantics for Prolog

  1996cites this paper
• A Multiple-Valued Logical Semantics for Prolog

  1996cites this paper
• Analysis of Pure PROLOG Programs

  1995cites this paper
• Improving Execution Models of Logic Programs by Two-phase Abstract Interpretation

  1995cites this paper
• A Transitional Semantics of Full Prolog

  1995cites this paper
• Observable Behaviors and Equivalences of Logic Programs

  1995cites this paper
• Partial Evaluation of the "Real Thing"

  1994cites this paper
• Termination of Logic Programs: The Never-Ending Story

  1994cites this paper
• Constraint Logic Programming: A Survey

  1994cites this paper
• A Formalization of Metaprogramming for real

  1993cites this paper
• Centrum Voor Wiskunde En Informatica the S-semantics Approach: Theory and Applications

  year unknowncites this paper