scientific article
From MaRDI portal
Publication:4051550
zbMath0297.68006MaRDI QIDQ4051550
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (81)
Reactive computing as model generation ⋮ A resolution principle for constrained logics ⋮ AND parallelism and nondeterminism in logic programs ⋮ Guarded horn clauses ⋮ Compacting Boolean Formulae for Inference in Probabilistic Logic Programming ⋮ Set abstraction - an extension of all solutions predicate in logic programming language ⋮ Negation with logical variables in conditional rewriting ⋮ Enumeration of success patterns in logic programs ⋮ Logic programming with external procedures: Introducing S-unification ⋮ Symbolic automatic relations and their applications to SMT and CHC solving ⋮ Unification in combinations of collapse-free regular theories ⋮ Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study ⋮ A fixpoint semantics of Horn sentences based on substitution sets ⋮ Can we transform logic programs into attribute grammars ? ⋮ Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\) ⋮ Mixed computation of Prolog programs ⋮ Disjunctive logic and semantics of disjunctive logic programs ⋮ Off-line reasoning for on-line efficiency: knowledge bases ⋮ Jack Minker --- A profile ⋮ The expressiveness of locally stratified programs ⋮ Programming in metric temporal logic ⋮ Recursive query processing in predicate-goal graph ⋮ Fifty Years of Prolog and Beyond ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Prolegomena to a theory of mechanized formal reasoning ⋮ Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3 ⋮ Immediate consequences operator on generalized quantifiers ⋮ Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks ⋮ In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming ⋮ Non-Horn clause logic programming ⋮ On updates of hybrid knowledge bases composed of ontologies and rules ⋮ Multiple data structuring ⋮ Reversible computing from a programming language perspective ⋮ Logical reduction of metarules ⋮ The fuzzy logic programming language FASILL: design and implementation ⋮ Semiring programming: a semantic framework for generalized sum product problems ⋮ Completeness of resolution revisited ⋮ Unnamed Item ⋮ Mixed logical-linear programming ⋮ Abductive logic programming agents with destructive databases ⋮ E-generalization using grammars ⋮ Designing context-aware systems: a method for understanding and analysing context in practice ⋮ Optimal parallel algorithms for forest and term matching ⋮ Logic and functional programming by retractions ⋮ Logic and functional programming by retractions : operational semantics ⋮ Making sense of sensory input ⋮ Making sense of raw input ⋮ Interval propagation to reason about sets: Definition and implementation of a practical language ⋮ A computational framework for conceptual blending ⋮ A series of revisions of David Poole's specificity ⋮ Horn clause computability ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ Fuzzy logic programming ⋮ An experimental logic based on the fundamental deduction principle ⋮ Multimodal logic programming ⋮ L-CATA: A logic-based expert travel system ⋮ Una classe di schemi ricorsivi non-deterministici paralleli ⋮ Paramodulated connection graphs ⋮ A resolution-based system for symbolic approximate reasoning ⋮ Negation in rule-based database languages: A survey ⋮ Answers that Have Integrity ⋮ Grammar-related transformations of logic programs ⋮ Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic ⋮ Logic program forms ⋮ Abstract interpretation of resolution-based semantics ⋮ Completeness of hyper-resolution via the semantics of disjunctive logic programs ⋮ Epistemology and artificial intelligence ⋮ The verification and synthesis of data structures ⋮ Grammatical unification ⋮ Concepts and realization of a high-performance data type architecture ⋮ Towards a programming language based on the notion of two-level grammar ⋮ A new combination of input and unit deductions for Horn sentences ⋮ Automated theorem proving methods ⋮ Modeling production rules by means of predicate transition networks ⋮ Is there an axiomatic semantics for standard pure Prolog? ⋮ Subset-equational programming in intelligent decision systems ⋮ Logic programming and knowledge representation---The A-Prolog perspective ⋮ Approximate reasoning by similarity-based SLD resolution. ⋮ Logical debugging ⋮ Group cancellation and resolution ⋮ Foundation of logic programming based on inductive definition
This page was built for publication:
