scientific article; zbMATH DE number 177828

MaRDI QIDQ4038706zbMATH OpenFDO

Authors Catuscia Palamidessi

Publication date 18 May 1993

zbMATH Keywords

concurrent logic programmingHorn clause logic

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic in artificial intelligence (68T27) Artificial intelligence (68T99)

Recommendations

• Publication:3199402
• Properties of substitutions and unifications
• Fully abstract compositional semantics for an algebra of logic programs
• scientific article; zbMATH DE number 2134134
• scientific article; zbMATH DE number 3858458

Cited in

(19)

• Abstract interpretation of resolution-based semantics
• From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
• C-expressions: A variable-free calculus for equational logic programming
• Weighted systems of equations
• A compositional semantics for logic programs
• A denotational semantics and dataflow construction for logic programs
• The role of standardising apart in logic programming
• SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
• Logical optimality of groundness analysis
• A framework for computing finite SLD trees
• On fuzzy unfolding: A multi-adjoint approach
• Abstract Diagnosis of First Order Functional Logic Programs
• Substitution, jumps, and algebraic effects
• Selective Unification in (Constraint) Logic Programming*
• A new algorithm for computing least generalization of a set of atoms
• Seeking a safe and efficient similarity-based unfolding rule
• A compositional semantic basis for the analysis of equational Horn programs
• Multi-valued logic programming semantics An algebraic approach
• Some properties of substitutions in the framework of similarity relations

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 Q4038706)