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

Bounded quantifications for iteration and concurrency in logic programming, Undecidable goals for completed acyclic programs, A declarative approach for first-order built-in's of Prolog, Logic programming in tensor spaces, On the relationship between TMS and logic programs, A quantitative approach to belief revision in structured probabilistic argumentation, Combining event calculus and description logic reasoning via logic programming, Nonmonotonic abductive inductive learning, Update operations in deductive databases with functional dependencies, Intuitionistic interpretation of deductive databases with incomplete information, Implementing constructive intensional negation, Learning directed probabilistic logical models: Ordering-search versus structure-search, What is failure? An approach to constructive negation, Specification, verification and prototyping of an optimized compiler, Reasoning about prolog programs: From modes through types to assertions, A hypergraph model for constraint logic programming and applications to bus drivers' scheduling, Describing symmetrical structures in logic., On the monotonicity of (LDL) logic programs with set., Termination of floating-point computations, Definite clause programs are canonical (over a suitable domain), Possibilistic uncertainty handling for answer set programming, Inferring negative information from disjunctive databases, Open problems in universal induction \& intelligence, Program equilibrium -- a program reasoning approach, Running programs backwards: The logical inversion of imperative computation, Intelligent backtracking in $\text{CLP}(\Re)$, Polynomial-time computable stable models, A new generic scheme for functional logic programming with constraints, Interleaving natural language parsing and generation through uniform processing, Graph traversal and top-down evaluation of logic queries, The least fixpoint transformation for disjunctive logic programs, Confluence in concurrent constraint programming, Certifying standard and stratified Datalog inference engines in SSReflect, Efficient inference and learning in a large knowledge base. Reasoning with extracted information using a locally groundable first-order probabilistic logic, A new probabilistic constraint logic programming language based on a generalised distribution semantics, Computing answers with model elimination, Decision-theoretic planning with generalized first-order decision diagrams, On decidability of the decomposability problem for finite theories, Planning in hybrid relational MDPs, Extended RDF: computability and complexity issues, Information-based distance measures and the canonical reflection of view updates, Semantics of structured normal logic programs, Weight constraint programs with evaluable functions, Updating knowledge bases, Focused most probable world computations in probabilistic logic programs, Closed world assumptions having precedence in predicates, $\mathcal I$-SATCHMORE: An improvement of $\mathcal A$-SATCHMORE, Between constructive mathematics and PROLOG, Acyclic logic programs and the completeness of SLDNF-resolution, A functorial framework for constraint normal logic programming, A sharing-based approach to supporting adaptation in service compositions, Derivation of logic programs by functional methods, On the tractability of minimal model computation for some CNF theories, Compositional operational semantics for Prolog programs, Answering queries from context-sensitive probabilistic knowledge bases, A semantic approach for web reasoning, Interval propagation to reason about sets: Definition and implementation of a practical language, Abstract conjunctive partial deduction for the analysis and compilation of coroutines, Relational linear programming, Equivalence of two fixed-point semantics for definitional higher-order logic programs, Stable and extension class theory for logic programs and default logics, Belief revision in structured probabilistic argumentation, model and application to cyber security, Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities, Proximity-based unification theory, A polymorphic type dependency analysis for logic programs, Compositional model-theoretic semantics for logic programs, Automated verification of state sequence invariants in general game playing, Graph properties for normal logic programs, Logic programs with abstract constraint atoms: the role of computations, Termination of narrowing via termination of rewriting, Reasoning with graph constraints, Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics, The foundations of DeLP: Defeating relations, games and truth values, A sound and complete semantics for a similarity-based logic programming language, On reductants in the framework of multi-adjoint logic programming, Syntax and semantics of multi-adjoint normal logic programming, Incremental learning of event definitions with inductive logic programming, Compiling a default reasoning system into Prolog, Negation in rule-based database languages: A survey, A semantics for modular general logic programs, Driving tabu search with case-based reasoning, Methods of solution and criteria of consistency of systems of linear Diophantine equations over the set of natural numbers, Abstract interpretation of resolution-based semantics, OLDTNF-based evaluation method for handling recursive queries in deductive databases, A hybrid programming scheme combining fuzzy-logic and functional-logic resources, Abductive reasoning through filtering, Renaming a set of non-Horn clauses, Relating CASL with other specification languages: the institution level., Learning closed Horn expressions, Completeness issues in RUE-NRF deduction: The undecidability of viability, Dualities between alternative semantics for logic programming and nonmonotonic reasoning, A semantical framework for supporting subjective and conditional probabilities in deductive databases, A compositional semantics for logic programs, Is there an axiomatic semantics for standard pure Prolog?, Mind change complexity of learning logic programs, The $\exists\forall^2$ fragment of the first-order theory of atomic set constraints is $\Pi_1^0$-hard, Information categories, The expressiveness of DAC, Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation, Derivation of efficient logic programs by specialization and reduction of nondeterminism, On the use of stochastic local search techniques to revise first-order logic theories from examples, SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy, Similarity-Based Equality with Lazy Evaluation, Model checking mobile ambients, Precise specification matching for adaptive reuse in embedded systems, On dual programs in co-logic programming and the Horn ${\mu}$-calculus, Operational semantics of resolution and productivity in Horn clause logic, On the Interaction of Existential Rules and Equality Constraints in Ontology Querying, An Equational Approach to Logic Programming, Probabilistic logic programming for hybrid relational domains, A logic programming system for nonmonotonic reasoning, First-order theories for pure Prolog programs with negation, Extending Co-logic Programs for Branching-Time Model Checking, Nonlinear pattern matching in rule-based modeling languages, Assumption-based argumentation is logic programming with projection, Default reasoning by deductive planning, Optimality in goal-dependent analysis of Sharing, Asynchronous communication model based on linear logic, A rational reconstruction of nonmonotonic truth maintenance systems, Categorial grammars determined from linguistic data by unification, Controlled query evaluation with open queries for a decidable relational submodel, Shifting vocabulary bias in speedup learning, On fuzzy unfolding: A multi-adjoint approach, Contextual nets, A new approach to hybrid probabilistic logic programs, A study of a dice problem, Explanations as programs in probabilistic logic programming, FOLD-R++: a scalable toolset for automated inductive learning of default theories from mixed data, A methodology for using a default and abductive reasoning system, Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation, Middle-out reasoning for synthesis and induction, Foundations of declarative testing in arbitrary logic programming, Reasoning about actions and obligations in first-order logic, The expressiveness of locally stratified programs, Well-founded and stationary models of logic programs, Complexity and undecidability results for logic programming, Representing diagnosis knowledge, Controlling the complexity in model-based diagnosis, Negation as failure for disjunctive logic programming, Super-Solutions, Terminating Evaluation of Logic Programs with Finite Three-Valued Models, Dealing with explicit preferences and uncertainty in answer set programming, An extension of pointwise circumscription, Computing most probable worlds of action probabilistic logic programs: scalable estimation for $10^{30,000}$ worlds, Constraint-based correctness proofs for logic program transformations, Complexity parameters for first order classes, Logical reduction of metarules, Epistemic logic programs: a study of some properties, Exact Learning of Finite Unions of Graph Patterns from Queries, From Fuzzy to Annotated Semantic Web Languages, Recent Advances in Datalog$$^\pm $$, Exploiting domain knowledge to detect outliers, Fast offline partial evaluation of logic programs, Unnamed Item, Fast learning of relational kernels, Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness, Extended multi-adjoint logic programming, Operational semantics for declarative multi-paradigm languages, Abductive reasoning in neural-symbolic systems, Heterogeneous active agents. III: Polynomially implementable agents, On Inductive Proofs by Extended Unfold/Fold Transformation Rules, Non-termination Analysis of Logic Programs Using Types, Game description language and dynamic epistemic logic compared, Handling Exceptions in Logic Programming without Negation as Failure, Logic programming: laxness and saturation, Mining closed patterns in relational, graph and network data, Why-provenance information for RDF, rules, and negation, Unnamed Item, Unnamed Item, A framework for linguistic logic programming, A framework for computing finite SLD trees, Transformations of logic programs on infinite lists, Markov logic networks, A hybrid reasoning system for terminologies and first-order clauses in knowledge bases, Efficient and flexible access control via Jones-optimal logic program specialisation, Totally correct logic program transformations via well-founded annotations, A Heuristic Approach to P2P Negotiation, L-CATA: A logic-based expert travel system, Checking content consistency of integrated web documents, Proof Relevant Corecursive Resolution, Justifications for logic programs under answer set semantics, Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming, Rule-Based Modeling of Transcriptional Attenuation at the Tryptophan Operon, Fast Offline Partial Evaluation of Large Logic Programs, ALPprolog – A new logic programming method for dynamic domains, Non-termination analysis of logic programs with integer arithmetics, (Co-)Inductive semantics for Constraint Handling Rules, On combining linear-based strategies for tabled evaluation of logic programs, Complex optimization in answer set programming, Efficient local unfolding with ancestor stacks, Polytool: Polynomial interpretations as a basis for termination analysis of logic programs, Probabilistic Rule Learning in Nonmonotonic Domains, Answers that Have Integrity, Fuzzy linguistic logic programming and its applications, Multi-context systems in dynamic environments, Extensional Semantics for Higher-Order Logic Programs with Negation, Removing algebraic data types from constrained Horn clauses using difference predicates, The dramatic true story of the frame default, Learning explanations for biological feedback with delays using an event calculus, Feasibility checking in Horn constraint systems through a reduction based approach, 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, Termination proofs of well-moded logic programs via conditional rewrite systems, Logic programs with polymorphic types: A condition for static type checking, Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation, Inductive constraint logic, Incremental learning of logic programs, Parallel Logic Programming: A Sequel, Analysis and Transformation of Constrained Horn Clauses for Program Verification, Fuzzy logic programs as hypergraphs. Termination results, Immediate consequences operator on generalized quantifiers, Analogical logic program synthesis algorithm that can refute inappropriate similarities, On correctness of normal logic programs, Unnamed Item, Answer set programming made easy, Proof-theoretic foundations of normal logic programs, Reversible debugging in logic programming, Fuzzy logic programming, The deductive IDEF1X data model of a tooling system, On the graph traversal method for evaluating linear binary-chain programs, Blackboard relations in the $\mu\text{Log}$ coordination model, Temporal disjunctive logic programming, Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness, On Dual Programs in Co-Logic Programming, Stratified negation in temporal logic programming and the cycle-sum test, Nonmonotonic reasoning by inhibition nets, A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases, Linking Data to Ontologies, The accepting power of unary string logic programs, Pac-learning non-recursive Prolog clauses, The Independent Choice Logic and Beyond, Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation, A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs, Approximation Schemes in Logic and Artificial Intelligence, An authorization model and its formal semantics