Fully abstract compositional semantics for an algebra of logic programs

DOI10.1016/0304-3975(95)00012-LzbMath0874.68192MaRDI QIDQ672703

Franco Turini, Antonio Brogi

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

program composition operations

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (4)

A unifying view for logic programming with non-monotonic reasoning ⋮ Knowledge representation with multiple logical theories and time ⋮ Abstract interpretation of resolution-based semantics ⋮ The reduced relative power operation on abstract domains

Cites Work

• Closures and fairness in the semantics of programming logic
• Declarative modeling of the operational behavior of logic languages
• Compositional model-theoretic semantics for logic programs
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• Reasoning about termination of pure Prolog programs
• Enumeration operators and modular logic programming
• On the efficiency of subsumption algorithms
• The Semantics of Predicate Logic as a Programming Language
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fully abstract compositional semantics for an algebra of logic programs