scientific article; zbMATH DE number 788036

zbMath0850.68137MaRDI QIDQ4844167

Ehud Shapiro, Leon S. Sterling

Publication date: 21 August 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Logic programming (68N17)

Related Items (46)

Correctness and Completeness of Logic Programs ⋮ From Logic to Functional Logic Programs ⋮ Evolution of rule-based programs ⋮ Ultra-strong machine learning: comprehensibility of programs learned with ILP ⋮ Identification of biological transition systems using meta-interpreted logic programs ⋮ Proving Arrow's theorem by \texttt{PROLOG} ⋮ VIRTUAL SHARED MEMORY MACHINES— AN APPLICATION OF PVM∗ ⋮ Specifying and Verbalising Answer Set Programs in Controlled Natural Language ⋮ Dynamic graph models ⋮ Generating contrastive explanations for inductive logic programming based on a near miss approach ⋮ A geometric interpretation of LD-resolution ⋮ New constructs for the description of combinatorial optimization problems in algebraic modeling languages ⋮ Schema induction for logic program synthesis ⋮ The Prolog Debugger and Declarative Programming ⋮ On Completeness of Logic Programs ⋮ Spatial reasoning about qualitative shape compositions. Composing qualitative lengths and angles ⋮ On Correctness and Completeness of an n Queens Program ⋮ Fifty Years of Prolog and Beyond ⋮ A relaxed condition for avoiding the occur-check ⋮ On definite program answers and least Herbrand models ⋮ S-semantics -- an example ⋮ Applying Constraint Logic Programming to SQL Semantic Analysis ⋮ In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming ⋮ Learning efficient logic programs ⋮ On combining ontologies and rules ⋮ The fuzzy logic programming language FASILL: design and implementation ⋮ \textsc{Tor}: modular search with hookable disjunction ⋮ Unnamed Item ⋮ Co-argumentation Artifact for Agent Societies ⋮ Proving completeness of logic programs with the cut ⋮ Physics and proof theory ⋮ Optimization schemas for parallel implementation of non‐deterministic languages and systems ⋮ Answering the “why” in answer set programming – A survey of explanation approaches ⋮ Introducing Computer Science to High School Students Through Logic Programming ⋮ Polynomial-time learnability of logic programs with local variables from entailment ⋮ On the interaction between sharing and linearity ⋮ Abstract interpretation of resolution-based semantics ⋮ Some classes of Prolog programs inferable from positive data ⋮ A qualitative spatial descriptor of group-robot interactions ⋮ Interactive Simplifier Tracing and Debugging in Isabelle ⋮ Syntactic Unification as a Geometric Operation in Free Modules over certain Rings ⋮ Program development schemata as derived rules ⋮ A constraint logic programming approach for generating all perfect matchings ⋮ Reporting Failures in Functional Logic Programs ⋮ Reasoning with infinite stable models ⋮ A backward slicing algorithm for Prolog

This page was built for publication: