scientific article; zbMATH DE number 788036
From MaRDI portal
Publication:4844167
zbMATH Open0850.68137MaRDI QIDQ4844167FDOQ4844167
Authors: Ehud Shapiro, Leon S. Sterling 
Publication date: 21 August 1995
Title of this publication is not available (Why is that?)
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Logic programming (68N17)
Cited In (48)
- Title not available (Why is that?)
- On the interaction between sharing and linearity
- Co-argumentation Artifact for Agent Societies
- A constraint logic programming approach for generating all perfect matchings
- The fuzzy logic programming language FASILL: design and implementation
- \textsc{Tor}: modular search with hookable disjunction
- Learning efficient logic programs
- Introducing computer science to high school students through logic programming
- On completeness of logic programs
- Reasoning with infinite stable models
- Correctness and completeness of logic programs
- A backward slicing algorithm for Prolog
- Evolution of rule-based programs
- Identification of biological transition systems using meta-interpreted logic programs
- Optimization schemas for parallel implementation of non-deterministic languages and systems
- VIRTUAL SHARED MEMORY MACHINES— AN APPLICATION OF PVM∗
- In praise of impredicativity: a contribution to the formalization of meta-programming
- New constructs for the description of combinatorial optimization problems in algebraic modeling languages
- On combining ontologies and rules
- Physics and proof theory
- Schema induction for logic program synthesis
- The Prolog debugger and declarative programming
- Dynamic graph models
- A geometric interpretation of LD-resolution
- From Logic to Functional Logic Programs
- On Correctness and Completeness of an n Queens Program
- S-semantics -- an example
- Generating contrastive explanations for inductive logic programming based on a near miss approach
- A relaxed condition for avoiding the occur-check
- Proving Arrow's theorem by \texttt{PROLOG}
- Fifty Years of Prolog and Beyond
- Answering the ``why in answer set programming -- a survey of explanation approaches
- On definite program answers and least Herbrand models
- Specifying and verbalising answer set programs in controlled natural language
- A note on occur-check
- Polynomial-time learnability of logic programs with local variables from entailment
- Spatial reasoning about qualitative shape compositions. Composing qualitative lengths and angles
- A qualitative spatial descriptor of group-robot interactions
- Proving completeness of logic programs with the cut
- Some classes of Prolog programs inferable from positive data
- Abstract interpretation of resolution-based semantics
- Lightweight functional logic meta-programming
- Syntactic unification as a geometric operation in free modules over certain rings
- Applying constraint logic programming to SQL semantic analysis
- Ultra-strong machine learning: comprehensibility of programs learned with ILP
- Reporting failures in functional logic programs
- Interactive simplifier tracing and debugging in Isabelle
- Program development schemata as derived rules
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4844167)
