scientific article

Publication date: 17 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

completeness PROLOG unification logic programming SLD-resolution closed world assumption soundness Herbrand model procedural semantics fixed-point theory declarative semantics infinite computation negation as failure rule answer substitution

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Model theory (03C99) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Mechanization of proofs and logical operations (03B35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)

Related Items (only showing first 100 items - show all)

From Logic to Functional Logic Programs ⋮ A New Algorithm for Computing Least Generalization of a Set of Atoms ⋮ Improving transformation systems for general E-unification ⋮ Toward a comprehensive treatment of temporal constraints about periodic events ⋮ European summer meeting of the Association for Symbolic Logic ⋮ 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ Intuitionistic three-valued logic and logic programming ⋮ Unnamed Item ⋮ Weakening the language bias in LINUS ⋮ Update rules in datalog programs ⋮ A deductive clustering approach ⋮ Argumentation-Based Semantics for Logic Programs with First-Order Formulae ⋮ Logic Programming with Defaults and Argumentation Theories ⋮ Multiagent reasoning with probability, time, and beliefs ⋮ Knowledge base dynamics, abduction, and database updates ⋮ An Extension Principle for Fuzzy Logics ⋮ Unfold/fold transformations of logic programs ⋮ A metalogic programming approach: language, semantics and applications ⋮ RASP and ASP as a fragment of linear logic ⋮ Domain theory for nonmonotonic functions ⋮ On the strong completion of logic programs ⋮ Eliminating negation from normal logic programs ⋮ Proving termination of general Prolog programs ⋮ Contextual occurrence nets and concurrent constraint programming ⋮ Verification of logic programs with delay declarations ⋮ Encoding natural semantics in Coq ⋮ Partial order programming (Revisited) ⋮ Merging heterogeneous security orderings ⋮ A refinement of import/export declarations in modular logic programming and its semantics ⋮ A paraconsistent relational data model ⋮ Algebraic methods in the compositional analysis of logic programs ⋮ Synthesizing Imperative Code from Answer Set Programming Specifications ⋮ Unnamed Item ⋮ A terminological interpretation of (abductive) logic programming ⋮ Game characterizations of logic program properties ⋮ Revision by communication ⋮ Learning categorial grammar by unification with negative constraints ⋮ The intricacies of three-valued extensional semantics for higher-order logic programs ⋮ Inference and learning in probabilistic logic programs using weighted Boolean formulas ⋮ Proving correctness of imperative programs by linearizing constrained Horn clauses ⋮ Concolic testing in logic programming ⋮ On definite program answers and least Herbrand models ⋮ About the proof-theoretic ordinals of weak fixed point theories ⋮ A category-theoretical approach to logic program development ⋮ In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming ⋮ Unnamed Item ⋮ Learning Effect Axioms via Probabilistic Logic Programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An assumption-based truth maintenance system dealing with non-ground justifications ⋮ Flexible coinductive logic programming ⋮ Efficient analysis of concurrent constraint logic programs ⋮ Formal reasoning about modules, reuse and their correctness ⋮ Contextual hypotheses and semantics of logic programs ⋮ A declarative extension of horn clauses, and its significance for datalog and its applications ⋮ Predicate Pairing for program verification ⋮ The pushdown method to optimize chain logic programs ⋮ Adding Metalogic Features to Knowledge Representation Languages* ⋮ Non-discriminating Arguments and Their Uses ⋮ A New Approach to Non-termination Analysis of Logic Programs ⋮ A Transformation-based implementation for CLP with qualification and proximity ⋮ An Interactive Driver for Goal-directed Proof Strategies ⋮ Oracle-Based Partial Evaluation ⋮ Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations ⋮ PALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters ⋮ Automated Verification of Weak Equivalence within the<scp>smodels</scp>System ⋮ Improving precision of type analysis using non-discriminative union ⋮ Incremental and Modular Context-sensitive Analysis ⋮ On Negative Unfolding in the Answer Set Semantics ⋮ USING META-PROGRAMMING, CONSTRAINT LOGIC PROGRAMMING AND APPROXIMATE REASONING FOR EXPERT SYSTEMS DESIGN ⋮ The search efficiency of theorem proving strategies ⋮ The applicability of logic program analysis and transformation to theorem proving ⋮ Detecting non-provable goals ⋮ Conservative query normalization on parallel circumscription ⋮ Bottom-up evaluation of Datalog programs with arithmetic constraints ⋮ On intuitionistic query answering in description bases ⋮ Programming with Annotated Logics ⋮ Efficient Unfolding of Fuzzy Connectives for Multi-adjoint Logic Programs ⋮ On the Incorporation of Interval-Valued Fuzzy Sets into the Bousi-Prolog System: Declarative Semantics, Implementation and Applications ⋮ Optimizing Fixpoint Evaluation of Logic Programs with Uncertainty ⋮ Towards a Type Discipline for Answer Set Programming ⋮ Abductive Logic Grammars ⋮ Modeling Interpretive Steps in Fuzzy Logic Computations ⋮ Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs ⋮ Properties of General Semantic Operators Determined by Logic-Based Systems ⋮ The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments ⋮ Termination prediction for general logic programs ⋮ An abductive framework for negation in disjunctive logic programming ⋮ Characterizing Compatible View Updates in Syntactic Bidirectionalization ⋮ Completeness of a top-down declarative error diagnoser ⋮ A Declarative Agent Programming Language Based on Action Theories ⋮ A qualitative spatial descriptor of group-robot interactions ⋮ A domain-theoretic approach to functional and logic programming ⋮ Multi-Label Classification Neural Networks with Hard Logical Constraints ⋮ Confidentiality Policies and Their Enforcement for Controlled Query Evaluation ⋮ A freeness and sharing analysis of logic programs based on a pre-interpretation ⋮ Automated modular termination proofs for real Prolog programs

This page was built for publication: