Publication:3862380
From MaRDI portal
zbMath0426.68002MaRDI QIDQ3862380
Publication date: 1979
Abstract data types; algebraic specification (68Q65) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Information storage and retrieval of data (68P20) Theory of software (68N99) Bibliographies for mathematics in general (00A15)
Related Items
Parallel Logic Programming: A Sequel, Semantical analysis of the logic of bunched implications, Three views on dependency covers from an FCA perspective, Definite Formulae, Negation-as-Failure, and the Base-Extension Semantics of Intuitionistic Propositional Logic, Fuzzy logic programming, Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach, α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic, The eco-cognitive model of abduction. II. Irrelevance and implausibility exculpated, A resolution principle for constrained logics, A view of programming languages as symbiosis of meaning and computations, Control and data driven execution of logic programs: A comparison, Path for AND-parallel execution of logic programs, On the termination of clause graph resolution, Communication in concurrent dynamic logic, Fuzzy sets and toposes - towards higher order fuzzy logic, Default reasoning by deductive planning, Evidential support logic programming, Inconsistency check of a set of clauses using Petri net reductions, Some results and experiments in programming techniques for propositional logic, A fixpoint semantics of Horn sentences based on substitution sets, Polynomial-time inference of all valid implications for Horn and related formulae, On finding optimal and near-optimal lineal spanning trees, Incomplete deductive databases, Unnamed Item, Operators vs. arguments: The ins and outs of reification, LOGIC DERIVATION OF PARALLEL LINEAR EQUATION SYSTEM SOLVERS WITHIN ELIMINATION STRATEGY, Logical Operations and Inference in the Complex s-Logic, Generalized LR Parsing for Grammars with Contexts, A new reduction rule for the connection graph proof procedure, Unification theory, A metalogic programming approach: language, semantics and applications, Defining answer classes using resolution refutation, Generalized LR parsing algorithm for grammars with one-sided contexts, A decade of TAPSOFT, Multi-dimensional logic programming: theoretical foundations, The independent choice logic for modelling multiple agents under uncertainty, A logic for default reasoning, Planning as tabled logic programming, In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming, The eco-cognitive model of abduction. Ἀπαγωγή now: naturalizing the logic of abduction, Abstract argumentation systems, Linear-space recognition for grammars with contexts, Issues in the design of a parallel object-oriented language, Logic programming with sets, Compact normal forms in propositional logic and integer programming formulations, Dynamic maintenance of directed hypergraphs, Transforming generate-and-test programs to execute under committed-choice AND-parallelism, Hypothetical datalog: Complexity and expressibility, Foundations of linear-time logic programming, \textsc{Tor}: modular search with hookable disjunction, Unnamed Item, Algorithms for generating arguments and counterarguments in propositional logic, A new deductive approach to planning, Yet another efficient backward execution algorithm in the AND/OR process model, Smart office robot collaboration based on multi-agent programming, A methodology for detecting shared variable dependencies in logic programs, Reduction rules for resolution-based systems, Compositional operational semantics for Prolog programs, Making sense of sensory input, Hilbert's epsilon as an operator of indefinite committed choice, Logical approach to control theory and applications, Situational Calculus, linear connection proofs and STRIPS-like planning: An experimental comparison, Unnamed Item, A logic-based calculus of events, Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations, A new subsumption method in the connection graph proof procedure, The alternating fixpoint of logic programs with negation, Preferential theory revision, An extension of context-free grammars with one-sided context specifications, An execution mechanism for nondeterministic, state-oriented programs based on a chart parser, A Logic Programming and Expert Statistical Systems Approach for Tissue Characterization in Magnetic Resonance Imaging, Horn clause computability, Knowledge and reasoning in program synthesis, Naturalizing logic, A deductive solution for plan generation, An experimental logic based on the fundamental deduction principle, A logical framework for depiction and image interpretation, The interval representation problem, Inconsistency-Tolerant Integrity Checking for Knowledge Assimilation, USING META-PROGRAMMING, CONSTRAINT LOGIC PROGRAMMING AND APPROXIMATE REASONING FOR EXPERT SYSTEMS DESIGN, A logico-algebraic approach to the model theory of knowledge, An Algorithm for Generating Arguments in Classical Predicate Logic, Preference-based belief revision for rule-based agents, Let's plan it deductively!, A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm, Possible worlds and resources: The semantics of \(\mathbf{BI}\), Don't Care Non-determinism in Logic Program Refinement, Proof-search in type-theoretic languages: An introduction, Rough Pragmatic Description Logic, The development and evaluation of a fuzzy logic expert system for renal transplantation assignment: Is this a useful tool?, Pronouns and quantifier-scope in English, A new combination of input and unit deductions for Horn sentences, On the correspondence between two classes of reduction systems, Closures and fairness in the semantics of programming logic, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games, Ordering conjunctive queries, Meta-interpretive learning as metarule specialisation, A heuristic in rules-based systems, Lambda-confluence for context rewriting systems, Gentzen-type systems, resolution and tableaux, Probabilistic Horn abduction and Bayesian networks, Improved normal form for grammars with one-sided contexts, Logic programming and knowledge representation---The A-Prolog perspective, A goal-directed decision procedure for hybrid PDL, Optimal fixedpoints of logic programs, Automated inferencing, Two-sided context specifications in formal grammars
