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