scientific article
From MaRDI portal
Publication:3742689
zbMath0605.68002MaRDI QIDQ3742689
Ehud Shapiro, Leon S. Sterling
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitydatabasecorrectnesssemanticsproblem solvingexpert systemsnegationlogic programmingsearch treesdebuggingdefinite clause grammarsparsingsearch techniqueslogical deductionrecursive programmingnon-deterministic programmingautomatic deductionequation solvermeta-interpreterssecond-order programmingEdinburg Prologgame-playing programsincomplete data structuresProlog programmingWisdom Prolog
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) General topics in the theory of software (68N01)
Related Items
A declarative approach for first-order built-in's of Prolog ⋮ Distributed programming with logic tuple spaces ⋮ Grammatically biased learning: Learning logic programs using an explicit antecedent description language ⋮ Problem solving by searching for models with a theorem prover ⋮ Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures ⋮ Optimization by non-deterministic, lazy rewriting ⋮ Uniform proofs as a foundation for logic programming ⋮ Definite-clause grammars for 2D shape analysis ⋮ Composing recursive logic programs with clausal join ⋮ Explaining evidential analyses ⋮ Automatic construction of accurate models of physical systems ⋮ A metalogic programming approach: language, semantics and applications ⋮ Acquiring object-knowledge ⋮ 2D tree object representation via the slope chain code ⋮ Logic programs with equational type specifications ⋮ On logic programming interpretations of Dislog: Programming long-distance dependencies in logic ⋮ An efficient multiple predicate learner ⋮ A refinement of import/export declarations in modular logic programming and its semantics ⋮ Is intractability of nonmonotonic reasoning a real drawback? ⋮ Declarative Compilation for Constraint Logic Programming ⋮ Situation calculus specifications for event calculus logic programs ⋮ Network reification as a unified approach to represent network adaptation principles within a network ⋮ Enigma 1225: Prolog-assisted solution of a puzzle using discrete mathematics ⋮ Model checking multi-agent systems with logic based Petri nets ⋮ CLP(ℛ) as a general finite element model definition language ⋮ Transforming generate-and-test programs to execute under committed-choice AND-parallelism ⋮ How to control unfolding when specializing interpreters ⋮ Unnamed Item ⋮ Collaborative software infrastructure for adaptive multiple model simulation ⋮ Mixed logical-linear programming ⋮ Parsing and generation with static discontinuity grammars ⋮ Unnamed Item ⋮ A theoretical framework on proactive information exchange in agent teamwork ⋮ Inductive logic programming ⋮ Derivation of logic programs by functional methods ⋮ Logic and functional programming by retractions ⋮ Precedences in specifications and implementations of programming languages ⋮ A New Proposal for Debugging Datalog Programs ⋮ Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations ⋮ Solving a cutting-stock problem with the constraint logic programming language CHIP ⋮ Singular and plural functions for functional logic programming ⋮ Difference-list transformation for Prolog ⋮ Virtual time and virtual space ⋮ Proof methods of declarative properties of definite programs ⋮ Logic programming: laxness and saturation ⋮ A Prolog technology theorem prover: A new exposition and implementation in Prolog ⋮ Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities ⋮ Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness ⋮ Agenda control for heterogeneous reasoners ⋮ Knowledge discovery and data mining in toxicology ⋮ Calculating modules in contextual logic program refinement ⋮ A mathematical treatment of defeasible reasoning and its implementation. ⋮ Knowledge representation with multiple logical theories and time ⋮ Reasoning about nonlinear system identification ⋮ The accepting power of unary string logic programs ⋮ Unnamed Item ⋮ Probabilistic Inductive Logic Programming ⋮ Basic Principles of Learning Bayesian Logic Programs ⋮ Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming ⋮ USING META-PROGRAMMING, CONSTRAINT LOGIC PROGRAMMING AND APPROXIMATE REASONING FOR EXPERT SYSTEMS DESIGN ⋮ Compilation and evaluation of linear mutual recursions ⋮ A demonstrably correct compiler ⋮ Set notation as a language to specify data transformation programs ⋮ Is default logic a reinvention of inductive-statistical reasoning? ⋮ Implementing tactics and tacticals in a higher-order logic programming language ⋮ Probabilistic Horn abduction and Bayesian networks ⋮ The Logiform system ⋮ PAN: A portable, parallel Prolog: Its design, realisation and performance. ⋮ Preference Logic Grammars: Fixed point semantics and application to data standardization ⋮ \({\mathcal Z}\)-match: An inference rule for incrementally elaborating set instantiations
