scientific article
From MaRDI portal
Publication:3339245
zbMath0547.68005MaRDI QIDQ3339245
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
completenessPROLOGunificationlogic programmingSLD-resolutionclosed world assumptionsoundnessHerbrand modelprocedural semanticsfixed-point theorydeclarative semanticsinfinite computationnegation as failure ruleanswer substitution
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
Computing definite logic programs by partial instantiation, A resolution principle for constrained logics, IDNAF Prolog, The role of standardising apart in logic programming, A logic-based approach to query processing in federated databases, Autoepistemic logic programming, The Qu-Prolog unification algorithm: formalisation and correctness, Multiple total stable models are definitely needed to solve unique solution problems, SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs, Relating logic programs via program maps, Generalized disjunctive well-founded semantics for logic programs., Computational complexity and constraint logic programming languages, Most specific logic programs, The inheritance of dynamic and deontic integrity constraints or: Does the boss have more rights?, Applications of compactness in the Smyth powerdomain of streams, The expressive powers of stable models for bound and unbound DATALOG queries, Mixed computation of Prolog programs, Generalized subsumption and its applications to induction and redundancy, Incremental constraint satisfaction for equational logic programming, Dynamic graph models, Contributions to the semantics of logic perpetual processes, A formal specification of document processing, On the relationship between circumscription and negation as failure, Minimalism, justification and non-monotonicity in deductive databases, On the relationship of congruence closure and unification, A rewrite mechanism for logic programs with negation, A note on the stable model semantics for logic programs, Linear generalized semi-monadic rewrite systems effectively preserve recognizability, A refined architecture for terminological systems: Terminology = Schema + Views, Programming in metric temporal logic, Algebraic structures in categorial grammar, Information flow in tabular interpretations for generalized push-down automata, General logical databases and programs: Default logic semantics and stratification, An analysis of loop checking mechanisms for logic programs, Semantics of Horn and disjunctive logic programs, Unfold/fold transformation of stratified programs, Horn clause programs with polymorphic types: Semantics and resolution, Relevant logic programming, Three-valued nonmonotonic formalisms and semantics of logic programs, A simple fixed point characterization of three-valued stable model semantics, Paraconsistent disjunctive deductive databases, Domains for logic programming, Contraction algebras and unification of (infinite) terms, An operational formal definition of PROLOG: A specification method and its application, A typed functional extension of logic programming, Extending Horn clause logic with implication goals, Learning elementary formal systems, A methodology for detecting shared variable dependencies in logic programs, Complete extension of general logic programs, Declarative testing of logic databases, Mints type deductive calculi for logic programming, A semantic backward chaining proof system, An explication of reasoning in multiple inheritance systems through non- monotonic Horn clause logic, A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses, A slight strengthening of a theorem of Blair and Kunen, Completions of perpetual logic programs, From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic, Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations, Counting propositional models, Free fuzzy groups and fuzzy group presentations, An algebraic semantics for structured transition systems and its application to logic programs, Testing logic programs for local stratification, The relationship between stable, supported, default and autoepistemic semantics for general logic programs, Multimodal logic programming using equational and order-sorted logic, Linear resolution for consequence finding, Generalizing completeness results for loop checks in logic programming, A new SLDNF-tree, On the relations between stable and well-founded semantics of logic programs, Transforming normal logic programs to constraint logic programs, Equivalence-preserving first-order unfold/fold transformation systems, Verifying local stratifiability of logic programs and databases, Probabilistic logic programming, Preservation of integrity constraints in definite DATALOG programs, An execution mechanism for nondeterministic, state-oriented programs based on a chart parser, Recursive query processing: The power of logic, Paraconsistent logic programming, Semantics of distributed definite clause programs, A relational approach to logic programming: The extended Alexander method, Top-down induction of first-order logical decision trees, Compositionality properties of SLD-derivations, Transforming constraint logic programs, Expressive power and complexity of partial models for disjunctive deductive databases, Soundness of abductive proof procedure with respect to constraint for non-ground abducibles, Recovery of (non)monotonic theories, Functional-logic integration via minimal reciprocal extensions, Sequences, datalog, and transducers, An implementation of Kripke-Kleene semantics, Free fuzzy modules and their bases, Type inference in Prolog: A new approach, Weighted systems of equations, On computational complexity of Prolog programs, Probabilistic Horn abduction and Bayesian networks, Logic program synthesis from first-order logic specifications, Sound and complete partial deduction with unfolding based on well-founded measures, An abstract machine for concurrent modular systems: CHARM, The number of \(Q\)-congruences in positive algebras, Norms on terms and their use in proving universal termination of a logic program, Bottom-up abstract interpretation of logic programs, Left termination turned into termination, Logical debugging, Computation of full logic programs using one-variable environments, Exploiting parallelism in coalgebraic logic programming, Unfold/fold transformations for disjunctive logic programs, Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules, Constructing simply recursive programs from a finite set of good examples, Convergence and fixed points by fuzzy orders, Generating languages by a derivation procedure for elementary formal systems, AID: an alternative implementation of DCGs, Semantics of infinite tree logic programming, Domain-independent formulas and databases, Making exhaustive search programs deterministic, Negation as failure: careful closure procedure, Embedding Boolean expressions into logic programming, Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions, Inductive assertion method for logic pograms, Connectionist modal logic: representing modalities in neural networks, A geometric interpretation of LD-resolution, A note on the model-theoretic semantics of fuzzy logic programming for dealing with inconsistency, Tree tuple languages from the logic programming point of view, An integrated framework for the diagnosis and correction of rule-based programs, A game semantics for disjunctive logic programming, Fuzzy inequational logic, Probabilistic (logic) programming concepts, Constraint-based probabilistic modeling for statistical abduction, Tabulation proof procedures for fuzzy linguistic logic programming, The complexity of reasoning with FODD and GFODD, On updates of hybrid knowledge bases composed of ontologies and rules, CAL: A theoretical background of constraint logic programming and its applications, First order compiler: A deterministic logic program synthesis algorithm, Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete, Protected completions of first-order general logic programs, Declarative modeling of the operational behavior of logic languages, Semantics for logic programs without occur check, Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming, Comparative metric semantics for concurrent PROLOG, Finite failures and partial computations in concurrent logic languages, A declarative semantics of flat guarded Horn clauses for programs with perpetual processes, The Prolog not-predicate and negation as failure rule, Conditional equational theories and complete sets of transformations, Constructive Boolean circuits and the exactness of timed ternary simulation, Hypothetical reasoning in logic programming: A semantic approach, A new deductive approach to planning, Query containment under bag and bag-set semantics, Three-valued completion for abductive logic programs, An algebraic formulation of the aggregative closure query, Transformations of CLP modules, A non-ground realization of the stable and well-founded semantics, Lazy narrowing: strong completeness and eager variable elimination, Nondeterminism and infinite computations in constraint programming, Computing minimal models by partial instantiation, Fully abstract compositional semantics for an algebra of logic programs, Contributions to the stable model semantics of logic programs with negation, Bottom-up evaluation and query optimization of well-founded models, Argument reduction by factoring, Multi-valued logic programming semantics An algebraic approach, Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs, Abstract interpretation: a kind of magic, Towards a mathematical theory of machine discovery from facts, An alternative linear semantics for allowed logic programs, Constraint logic programming with a relational machine, Kripke semantics for higher-order type theory applied to constraint logic programming languages, Virtual time and virtual space, Removing redundancy from a clause, Skeptical reason maintenance and belief revision, Proof methods of declarative properties of definite programs, Graph rewriting for a partial ordering semantics of concurrent constraints programming, Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming, Semantics and properties of existential quantifiers in deductive databases, A logic for programming with complex objects, The alternating fixpoint of logic programs with negation, Theory matrices (for modal logics) using alphabetical monotonicity, Parsing as non-Horn deduction, A closed-form evaluation for Datalog queries with integer (gap)-order constraints, Equality and abductive residua for Horn clauses, Legality concepts for three-valued logic programs, A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete, On minimal sets of graded attribute implications, Fuzzy logic programming reduced to reasoning with attribute implications, Enhancing global SLS-resolution with loop cutting and tabling mechanisms, Equivalence for the \(G_3^\prime\)-stable models semantics, On reasoning about structural equality in XML: a description logic approach, Making assumptions in the automated derivation, A method for symbolic analysis of security protocols, Declarative error diagnosis, Fixed point equations with parameters in the projective model, Temporal logic programming, Minimal bases of temporal attribute implications, On the parameterized complexity of associative and commutative unification, Programming in three-valued logic, Negation by default and unstratifiable logic programs, On the algebraic structure of declarative programming languages, S-semantics for logic programming: a retrospective look, Completeness of hyper-resolution via the semantics of disjunctive logic programs, Subset-equational programming in intelligent decision systems, Comparative semantics for flow of control in logic programming without logic, Completeness of an improved declarative debugger, A relevance restriction strategy for automated deduction, A framework for linguistic modelling, Reasoning with infinite stable models, Order-sorted logic programming with predicate hierarchy, Formal semantics of meta-level architectures: Dynamic control of reasoning, Software Development in Relation Algebra with Ampersand, Index Sets for Finite Normal Predicate Logic Programs with Function Symbols, Synthesis of positive logic programs for checking a class of definitions with infinite quantification, Optimization by non-deterministic, lazy rewriting, Equational and membership constraints for infinite trees, Kernel-LEAF: A logic plus functional language, Unification modulo an equality theory for equational logic programming, The fixed points of logic programs with Herbrand base \({\mathbb{N}}\), Deciding the Bisimilarity Relation between Datalog Goals, Fuzzy sets in approximate reasoning. II: Logical approaches, On learnability of restricted classes of categorial grammars, Top-down and Bottom-up Evaluation Procedurally Integrated, Predicate invention and utilization, Minimality of a solution update in conflict resolution: An application of revision programming to the von Neumann-Morgenstern approach, On the relationship between CWA, minimal model, and minimal herbrand model semantics, Truth versus information in logic programming, Algèbres effectives dans la programmation logique avec contraintes, Learning Through Hypothesis Refinement Using Answer Set Programming, The query topology in logic programming, Multi-modal logic programming using equational and order-sorted logic, Fixpoint techniques for non-monotone maps, An equivalence preserving first order unfold/fold transformation system, Jungle rewriting: An abstract description of a lazy narrowing machine, A rewrite approach for constraint logic programming, Logic Programming, Argumentation and Human Reasoning, Declarative Compilation for Constraint Logic Programming, Complexity results for abductive logic programming, Seeking a safe and efficient similarity-based unfolding rule, Lifted inference for statistical statements in probabilistic answer set programming, Productive corecursion in logic programming, Unfolding for CHR programs, Decidability of the Clark's completion semantics for monadic programs and queries, Tabling with Sound Answer Subsumption, Typed SLD-resolution: dynamic typing for logic programming, 1993 Annual Meeting of the Australasian Association for Logic, About Epistemic Negation and World Views in Epistemic Logic Programs, The Expressive Power of Higher-Order Datalog, Constraint and Logic Programming: Ugo Montanari’s Main Contributions and Introduction to the Volume Section, \(\alpha\)ILP: thinking visual scenes as differentiable logic programs, Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas, Definite Formulae, Negation-as-Failure, and the Base-Extension Semantics of Intuitionistic Propositional Logic, Foundations of linear-time logic programming, Sémantique logique et dénotationnelle des interpréteurs PROLOG, On quasi-varieties of multiple valued logic models, A formal framework for causal modeling and argumentation, Inductive logic programming, Logic and functional programming by retractions, A New Proposal for Debugging Datalog Programs, An Optimal Strategy for the Constrained Cycle Cover Problem, Values Suggestion in Mixed Integer Programming by Machine Learning Algorithm, Transforming floundering into success, Manipulating Tree Tuple Languages by Transforming Logic Programs1 1Extended abstract; see http://www.logic.at/css/ftp03.pdf for the proofs., Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and Folding, Theorem proving techniques for view deletion in databases, Assertion based Inductive Verification Methods for Logic Programs, On the Coincidence of Semantics for Uniquely Determined Programs, Correct Answers for First Order Logic, Logic programs as specifications in the inductive verification of logic programs, A general theory of confluent rewriting systems for logic programming and its applications, A decidable subclass of finitary programs, PRL: a probabilistic relational language, Symbolic knowledge extraction from trained neural networks: A sound approach, \(\exists\)-Universal termination of logic programs, The limits of fixed-order computation, Temporal agent programs, Learning logic programs with structured background knowledge, Fuzzy logic programming, Fuzzy control as a fuzzy deduction system, A rewrite mechanism for logic programs with negation, Connectionist computations of intuitionistic reasoning, Multimodal logic programming, Reasoning about nonlinear system identification, Polynomial-time learnability of logic programs with local variables from entailment, Agent-oriented probabilistic logic programming, Loop checks for logic programs with functions, A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics, Probabilistic Inductive Logic Programming, Basic Principles of Learning Bayesian Logic Programs, On the complexity of dataflow analysis of logic programs, On Generalization and Subsumption for Ordered Clauses, Pac-learning non-recursive Prolog clauses, On finitely recursive programs, Logic-Based Probabilistic Modeling, A Class of Rewriting Rules and Reverse Transformation for Rule-based Equivalent Transformation, Type Inference using Constraint Handling Rules, Timed Term Rewrite Systems, Temporal stratification tests for linear and branching-time deductive databases, On the Efficient Execution of ProbLog Programs, On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP, Composing Normal Programs with Function Symbols, On the verification of finite failure, The subsumption lattice and query learning, Formal Properties of Needed Narrowing with Similarity Relations, A Study on the Practicality of Poly-Controlled Partial Evaluation, Foundations of logic programming in hybrid logics with user-defined sharing, Abduction in logic programming: A new definition and an abductive procedure based on rewriting, Refutable language learning with a neighbor system., Planning with regression analysis in transaction logic, Evolution of rule-based programs, Logic of temporal attribute implications, Satisfiability of the smallest binary program, Logic programs and connectionist networks, Logic programs, iterated function systems, and recurrent radial basis function networks, An extension of the stable semantics via Lukasiewicz logic, SATCHMORE: SATCHMO with RElevancy, Logic programming with solution preferences, A formal semantics for DAI language NUML, Counting for satisfiability by inverting resolution, Heuristics for planning with penalties and rewards formulated in logic and computed through circuits, Herbrand theorems in arbitrary institutions, Kinded type inference for parametric overloading, A note on measures of fuzziness applied to nonmonotonic fuzzy propositional logic, Evidence-based pattern classification: A structural approach to human perceptual learning and generalization, Recognition-by-parts: A computational approach to human learning and generalization of shapes, On recursively enumerable structures, On Skolemization in constrained logics, Thresholded semantic framework for a fully integrated fuzzy logic language, Linear and unit-resulting refutations for Horn theories, On inductive inference of cyclic structures, Well-founded and stationary models of logic programs, Preference logics: Towards a unified approach to nonmonotonicity in deductive reasoning, How expressive is stratified aggregation?, Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints, Closure structures parameterized by systems of isotone Galois connections, Revision programming, Logical settings for concept-learning, Abduction from logic programs: Semantics and complexity, A logical semantics for depth-first Prolog with ground negation, A framework for incremental learning of logic programs, Multi-dimensional logic programming: theoretical foundations, An order-sorted resolution in theory and practice, Institutions for logic programming, Order-sorted model theory for temporal executable specifications, A confluent calculus for concurrent constraint programming, Linguistic\(\leftrightarrow \)rational agents' semantics, A new framework for declarative programming, Non-Horn clause logic programming, Higher-order Petri net models based on artificial neural networks, An extended constraint deductive database: theory and implementation, Generalized metrics and uniquely determined logic programs., HTN-like solutions for classical planning problems: an application to BDI agent systems, In defense of PDDL axioms, Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes), Inductive Logic Programming: Issues, results and the challenge of Learning Language in Logic, A paraconsistent logic programming approach for querying inconsistent databases, Making sense of sensory input, A semantics for hybrid probabilistic logic programs with function symbols, Neural probabilistic logic programming in DeepProbLog, Making sense of raw input, Inferring phylogenetic trees using answer set programming, Dynamic reordering of alternatives for definite logic programs, Semantics of temporal constrained objects, NIS-apriori-based rule generation with three-way decisions and its application system in SQL, A fixed point theorem for non-monotonic functions, Agenda control for heterogeneous reasoners, Generalized domination in closure systems, Relation algebra as programming language using the Ampersand compiler, Quantifier elimination for infinite terms, Quasi-closed elements in fuzzy posets, Horn equational theories and paramodulation, Basic narrowing revisited, A sound and complete semantics for a version of negation as failure, Weak generalized closed world assumption, A fuzzy logic with interval truth values, Annotated fuzzy logic programs, Abduction with probabilistic logic programming under the distribution semantics, Type dependencies for logic programs using ACI-unification, Loop checking in SLD-derivations by well-quasi-ordering of goals, Some classes of Prolog programs inferable from positive data, Verification of reactive systems using temporal logic with clocks, Linear strategy for Boolean ring based theorem proving, ConGolog, a concurrent programming language based on the situation calculus, An abstract formalization of correct schemas for program synthesis, Prioritized logic programming and its application to commonsense reasoning, On the complexity of data disjunctions., Relating defeasible and normal logic programming through transformation properties., An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations., Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\)., Semantics of temporal classes, On a generalized notion of mistake bounds, A theory of observables for logic programs, A comparative study of open default theories, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games, On the equivalence between logic programming semantics and argumentation semantics, Can you answer while you wait?, A hidden Herbrand theorem: Combining the object and logic paradigms, A constraint logic programming approach for generating all perfect matchings, Functional queries in datalog, Preference Logic Grammars: Fixed point semantics and application to data standardization, Fixpoint semantics for logic programming a survey, Approximate reasoning by similarity-based SLD resolution., Policy-based inconsistency management in relational databases, Using possibilistic logic for modeling qualitative decision: answer set programming algorithms, An optimal data structure to handle dynamic environments in non-deterministic computations
