A strong logic programming view for static embedded implications

DOI10.1007/3-540-49019-1_5MaRDI QIDQ4260700zbMATH OpenFDO

Authors R. Arruabarrena, P. Lucio, M. Navarro

Publication date 1 September 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49019-1_5

zbMATH Keywords

intuitionistic logiclogic programmingmodulesstatic scoping

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17)

Review text

Several extensions of logic programming have considered the notions of blocks and modules under a static scoping approach. In particular, one of these extensions introduces the notion of embedded implication, that is, the Horn clauses language is extended by allowing also goals of the form \(D\supset G\) where \(D\) is a set of local clauses which can be used for proving \(G\) (under a static scoring rule). Bulloing previous work by Meseguer, in the present paper a logical characterization for such a language is given and a related soundness and completeness result is proven. For the entire collection see [Zbl 0911.00045].

Recommendations

• Extending Horn clause logic with implication goals
• A Transformational Semantics of Static Embedded Implications of Normal Logic Programs
• Structuring logic programs: a modal approach
• Semantics of structured normal logic programs

Cited in

(3)

• Semantics of structured normal logic programs
• A Transformational Semantics of Static Embedded Implications of Normal Logic Programs
• Translating propositional extended conjunctions of Horn clauses into Boolean circuits

This page was built for publication: A strong logic programming view for static embedded implications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4260700)