Перейти к основному содержанию
Мемориальная библиотека А.П. Ершова
Toggle navigation
Издания
Журналы
Новые поступления
Вы здесь
Главная
Logic Programming: Proc./1991 Intern. Symp.
Связанные издания:
Abstract Interpretation of Constraints on Order-Sorted Domains
Abstract Views of Prolog Executions in Opium
A Clausal Logic for Deontic Action Specification
A Complete Top-down Interpreter for First Order Programs
A Declarative Alternative to "assert" in Logic Programming
A General Criterion for Avoiding Infinite Unfolding during Partial Deduction of Logic Programs
A Modal Reconstruction of Blocks and Modules in Logic Programming
An Alternative Characterization of Disjunctive Logic Programs
A New Scheme for Unification in WAM
A Simulation Study of Or- and Independent And-parallelism
A Static Load Partitioning Method Based on Execution Profile for Committed Choice Languages
A Termination Test for Logic Programs
Automatic Termination Proofs for Prolog Programs Operating on Nonground Terms
Automattic Generation of Simplification Lemmas for Inductive Proofs
Copy Avoidance through Compile-Time Analysis and Local Reuse
Counterfactual Reasoning Based on Revising Assumptions
Derivation of Efficient Logic Programs by Synthesizing New Predicates
Experiences from a Large Industrial Circuit Design Application
Extending the Warren Abstract Machine to Polimorphic Order-Sorted Resolution
Fifth Generation Computer Project: towards Large-scale Knowledge Information Processing
Higher-Order Horn Logic Programming
IDIOM: Integrating Dependent and-, Independent and-, and Or-parallelism
Integrating Numerical and Qualitative Models within Constraint Logic Programming
Intelligent backtracking for CLP languages. An application to CLP (R)
Magic Sets and Bottom-Up Evaluation of Well-Founded Models
Non-monotonic Reasoning And Logic Programming
Programming Paradigms of the Andorra Kernel Language
Program Transformation under the Principle of Proof as Program
Prolog Testing of C Modules
Reasoning and Programming: Analogies between Logic and Computation
Reforming Compilation of Logic Programs
Semantics of Logic Programs with Aggregates
Some Global Compile-Time Optimizations for CLP(R)
Stable Theories for Logic Programs
Synthesis of a Family of Recursive Sorting Procedures
Temporal Debugging and its Visual Animation
Temporal Logic Programming and its Relation to Constraint Logic Programming
The Uniform Proof-theoretic Foundation of Linear Logic Programming
Top-Down vs. Bottom-Up Revisited
True Concurrency in Concurrent Constraint Programming
Typed Feature Structures: a Generalization of First-order Terms
Typed Prolog: A Semantic Reconstruction of the Mycroft-O Keefe Type System
Using Dynamic Predicates in an Or-Parallel Prolog System
Well-Founded Semantics, Generalized