scientific article
From MaRDI portal
zbMath0466.68009MaRDI QIDQ3919057
William F. Clocksin, Christopher S. Mellish
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of compilers and interpreters (68N20) Abstract data types; algebraic specification (68Q65) Subsystems of classical logic (including intuitionistic logic) (03B20) Theory of software (68N99) Software, source code, etc. for problems pertaining to computer science (68-04)
Related Items
Computation of full logic programs using one-variable environments, The occur-check problem in Prolog, Correctness and Completeness of Logic Programs, Three systems for cryptographic protocol analysis, Using case based reasoning for basis development in intelligent decision systems, A new list compaction method, An algebraic semantics approach to the effective resolution of type equations, Subsumption and implication, A note on the proof theory of the \(\lambda \Pi\)-calculus, Communication in concurrent dynamic logic, Using automated reasoning tools: A study of the semigroup \(F_ 2B_ 2\), The implementation of FPROLOG - a fuzzy PROLOG interpreter, Embedding Boolean expressions into logic programming, Dynamic backward reasoning systems, Automatic inductive theorem proving using Prolog, LOGIC DERIVATION OF PARALLEL LINEAR EQUATION SYSTEM SOLVERS WITHIN ELIMINATION STRATEGY, Avoiding omnidoxasticity in logics of belief: A reply to MacPherson, Implication of clauses is undecidable, Solving problems with automated reasoning, expert systems and neural networks, Logicon: An integration of prolog into icon, Fundamentals of Fuzzy Prolog, A geometric interpretation of LD-resolution, Solving symbolic equations with PRESS, PALO: a probabilistic hill-climbing algorithm, A circumscriptive theorem prover, Unification theory, Financial statement planning in the presence of tax constraints, Tight Bounds for Cut-Operations on Deterministic Finite Automata, Fifty Years of Prolog and Beyond, In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming, Non-Horn clause logic programming, IeanCOP: lean connection-based theorem proving, First order compiler: A deterministic logic program synthesis algorithm, An epistemic model of logic programming, Unnamed Item, Unnamed Item, Collaborative software infrastructure for adaptive multiple model simulation, Algorithms for the Routh-Hurwitz stability test, Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language, An analysis of loop checking mechanisms for logic programs, HALO --- a fuzzy programming language, Unnamed Item, Derivation of logic programs by functional methods, Optimal parallel algorithms for forest and term matching, Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations, Removing redundancy from a clause, A series of revisions of David Poole's specificity, A Logic Programming and Expert Statistical Systems Approach for Tissue Characterization in Magnetic Resonance Imaging, Core instances for testing: a case study, EXTRA: An expert system for multicriteria decision making, A logical framework for depiction and image interpretation, Temporal logic programming, Object-oriented simulation to support research in manufacturing systems, Unnamed Item, How to invent a Prolog machine, P-Prolog: A parallel logic language based on exclusive relation, Prolog technology for default reasoning: proof theory and compilation techniques, European Summer Meeting of the Association for Symbolic Logic, Paris, 1985, Two WAM Implementations of Action Rules, Renaming a set of non-Horn clauses, Inductive synthesis of recursive processes from logical properties, Formal frameworks for approximate reasoning, On computational complexity of Prolog programs, Minimal Boolean sum-of-product forms in PROLOG, Implementation of the grid file: Design concepts and experience, An analytical comparison of some rule-learning programs, Some deterministic models of concept identification, Complete problems in the first-order predicate calculus
