Вы здесь

Главная

Logic Programming: Proc./Eight Intern. Conf.

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

A Clausal Form for the Completion of Logic Programs
A Model Generation Theorem Prover in KL1 Using a Ramified-Stack Algorithm
A Semantical Framework for Supporting Subjective and Conditional Probabilities in Deductive Databases
A Setof Tools for VHDL Design
Automatic Complexity Analysis of Logic Programs
Bottom-Up Evalution of Hierarchical Disjunctive Deductive Databases
CARMEL-4: The Unify-Spawn Machine for FCP
Computing Abduction by Using the TMS
Constraint Operations for CLP(FT)
Extended Logic Programs with Default Assumption
Implementation Techniques for Scoping Constructs in Logic Programming
Naive Reverse can be Linear
Nonmonotonic Reasoning with Well Founded Semantics
On Generalized Cover Axioms
Overview of the CHIP Compiler System
Perfect Model Semantics for Logic Programs with Equality
Performance of Aurora on NUMA Machines
Proving Correctness of Logic Programs Using Axiomatic Semantics
Proving Program Properties by means of SLS-Resolution
Restriction Site Mapping in CLP(R)
Scheduling Or-Parallelism in Muse
Substitution and Refutation Revisited
The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model
The Cardinality Operator: A New Logical Connective for Constraint Logic Programming
Towards Possibilistic Logic Programming
Well-Founded Completions of Logic Programs