Extensions of logic programming. International workshop, Tübingen, FRG, 8--10 December 1989. Proceedings

DOI10.1007/BFB0038689zbMath0770.68025OpenAlexW4244418619MaRDI QIDQ1188837

No author found.

Publication date: 17 September 1992

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

Full work available at URL: https://doi.org/10.1007/bfb0038689

zbMATH Keywords

ProceedingsWorkshopLogic programmingreasoningunificationnatural deductionCurry-Howard isomorphismnegation as failureabstract data typesconcurrent logic programmingSLDNF resolutioncomputational logicsModularityClark's completionLinear LogicHarrop formulas\(\lambda\)PrologGentzen-style sequent calculushigher-order logic programmingHorn clause programmingTübingen (FRG)

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Structure of proofs (03F07) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Other constructive mathematics (03F65) Intuitionistic mathematics (03F55) Complexity of proofs (03F20) Proof theory and constructive mathematics (03F99)

Related Items (1)

Clausal intuitionistic logic I. fixed-point semantics

This page was built for publication: Extensions of logic programming. International workshop, Tübingen, FRG, 8--10 December 1989. Proceedings