scientific article; zbMATH DE number 4053011
From MaRDI portal
Publication:3789064
Recommendations
Cited in
(81)- An improved reductant calculus using fuzzy partial evaluation techniques
- Context unification with one context variable
- On the transformation of logic programs with instantiation based computation rules
- Unification theory
- The quotient of an abstract interpretation
- Semantic models for concurrent logic languages
- A canonical form for generalized linear constraints
- A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses
- Unfolding and fixpoint semantics of concurrent constraint logic programs
- Unification under a mixed prefix
- C-expressions: A variable-free calculus for equational logic programming
- The transition to unigroups
- Compositionality properties of SLD-derivations
- The reduced relative power operation on abstract domains
- A compositional semantics for logic programs
- Sound and complete partial deduction with unfolding based on well-founded measures
- A feature constraint system for logic programming with entailment
- Logic program synthesis from incomplete specifications
- Logic of proofs
- Computing definite logic programs by partial instantiation
- The role of standardising apart in logic programming
- Most specific logic programs
- Incremental constraint satisfaction for equational logic programming
- Relaxed unification -- proposal
- On deciding subsumption problems
- Proving quantified literals in defeasible logic
- Explicit versus implicit representations of subsets of the Herbrand universe.
- Evolution of rule-based programs
- Linearisability on Datalog programs
- Category-based modularisation for equational logic programming
- On inductive inference of cyclic structures
- Syntactical models and fixed points for the basic logic of proofs
- The powerset operator on abstract interpretations
- A note on unification, subsumption and unification type
- On fuzzy unfolding: A multi-adjoint approach
- A modular order-sorted equational generalization algorithm
- Essential unifiers
- Generalizing DPLL and satisfiability for equalities
- Unification theory
- Syntactic unification as a geometric operation in free modules over certain rings
- Efficient reductants calculi using partial evaluation techniques with thresholding
- scientific article; zbMATH DE number 4016225 (Why is no real title available?)
- Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets
- A Modular Equational Generalization Algorithm
- scientific article; zbMATH DE number 3957052 (Why is no real title available?)
- scientific article; zbMATH DE number 4035119 (Why is no real title available?)
- Unification: a multidisciplinary survey
- scientific article; zbMATH DE number 1267560 (Why is no real title available?)
- Reverse universal resolving algorithm and inverse driving
- scientific article; zbMATH DE number 2043526 (Why is no real title available?)
- scientific article; zbMATH DE number 2088067 (Why is no real title available?)
- Order-sorted generalization
- A new algorithm for computing least generalization of a set of atoms
- Typed Relational Conversion
- Unfolding and fixpoint semantics of concurrent constraint logic programs
- Uniting Observers
- Symbolic unfolding of multi-adjoint logic programs
- Proximity-based unification theory
- Optimizing fuzzy logic programs by unfolding, aggregation and folding
- scientific article; zbMATH DE number 2209392 (Why is no real title available?)
- scientific article; zbMATH DE number 2232298 (Why is no real title available?)
- The narrowing-driven approach to functional logic program specialization
- A geometric interpretation of LD-resolution
- A compositional semantic basis for the analysis of equational Horn programs
- Transformations of CLP modules
- A non-ground realization of the stable and well-founded semantics
- Computing minimal models by partial instantiation
- A complete and recursive feature theory
- Intensional aspects of function definitions
- Multi-valued logic programming semantics An algebraic approach
- Abstract interpretation: a kind of magic
- Difference-list transformation for Prolog
- Complete axiomatizations of some quotient term algebras
- Average-case analysis of unification algorithms
- A class of programs for which SLDNF resolution and NAF rule are complete
- Automating the derivation of unification algorithms. A case study in deductive program synthesis
- Debugging Maude programs via runtime assertion checking and trace slicing
- Exceptional unification of families and forces
- First order compiler: A deterministic logic program synthesis algorithm
- Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses
- Theories with the independence property
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 Q3789064)
