Вы здесь

Главная

Logic Programming: Proc./Eighth Intern. Conf.

Связанные издания:

A Generic Abstract Interpretation Algorithm and Its Complexity Analysis
AMLOG-E: A New Approach towards Amalgamation
An Algebraic Semantics of Prolog Program Termination
An Intensional Logic of (Multi-Arity) Set Abstractions
Combined Determination of Sharing and Freeness of Program Variables through Abstract Interpretation
Compilation Techniques for Nondeterminate Flat Concurrent Logic Programming Languages
Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis
Deriving Termination Proofs for Logic Programs, using Abstract Procedures
Explaining SLDNF Resolution with Non-Normal Defaults
Extended Well-Founded Model Semantics for General Logic Programs
Extending S-Models to Logic Programs with Negation
Extending the WAM for Intelligent Backtracking
Higher Level Meta Programming in Qu-Prolog 3.0
Higher-Order Unification as a Theorem Proving Procedure
Lexical Logic Programs
{log}: A Logic Programming Language with Finite Sets
Modeling Answer Constraints in Constraint Logic Programs
Negation as Instantiation: A new Rule for the Treatment of Negation in Logic Programming
Negations as Hypotheses: An Abductive Foundation for Logic Programming
NUA-Prolog: An Extension to the WAM for Parallel Andorra
Perfect Relaxation in Constraint Logic Programming
Polymorphically Typed Logic Programs
Real-size Compiler Writing using Prolog with Arrows
Recursion vs. Iteration in Prolog
Register Allocation in WAM
Specifications as Search Keys for Software Libraries
Suspension Analysis for Concurrent Logic Programs
The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model
Toward Automatic Test Data Set Selection Using Algebraic Specifications and Logic Programming
Unification of Simply Typed Lambda-Terms as Logic Programming