default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. ELP 1996: Leipzig, Germany
- Roy Dyckhoff, Heinrich Herre, Peter Schroeder-Heister:
Extensions of Logic Programming, 5th International Workshop, ELP'96, Leipzig, Germany, March 28-30, 1996, Proceedings. Lecture Notes in Computer Science 1050, Springer 1996, ISBN 3-540-60983-0 - Martin Argenius, Andrei Voronkov:
Semantics of Constraint Logic Programs with Bounded Quantifiers. 1-18 - Matteo Baldoni, Laura Giordano, Alberto Martelli:
Translating a Modal Language with Embedded Implication into Horn Clause Logic. 19-33 - Antonio Brogi
, Cosimo Guarino:
Pruning the Search Space of Logic Programs. 35-49 - Ricardo Caferra, Nicolas Peltier:
A Significant Extension of Logic Programming by Adapting Model Building Rules. 51-65 - Iliano Cervesato, Joshua S. Hodas, Frank Pfenning:
Efficient Resource Management for Linear Logic Proof Search. 67-81 - Paolo Ciancarini, Daniela Fogli, Mauro Gaspari:
A Logic Language based on GAMMA-like Multiset Rewriting. 83-101 - Carlos Viegas Damásio, Luís Moniz Pereira:
Default Negated Conclusions: Why Not? 103-117 - Anatoli Degtyarev, Andrei Voronkov:
Handling Equality in Logic Programming via Basic Folding. 119-136 - Kerstin Eder, Steffen Hölldobler, Michael Thielscher:
An Abstract Machine for Reasoning about Situations, Actions, and Causality. 137-151 - Jörg Hudelmaier:
On the Computational Complexity of Propositional Logic Programs with Nested Implications. 153-159 - Catholijn M. Jonker:
Proof-theory for Extensions of Logic Programming. 161-175 - Yoshiki Kinoshita, A. John Power:
A Fibrational Semantics for Logic Programs. 177-191 - Herbert Kuchen, Josef Anastasiadis:
Higher Order Babel: Language and Implementation. 193-207 - James Lipton, Stacy E. Finkelstein, Peter J. Freyd:
A New Framework for Declarative Programming: Categorial Perspectives. 209-211 - Juan José Moreno-Navarro:
Extending Constructive Negation for Partial Functions in Lazy Functional-logic Languages. 213-227 - Teodor C. Przymusinski:
Super Logic Programs and Negation as Belief. 229-235 - Robert F. Stärk:
Total Correctness of Logic Programs: A Formal Approach. 237-254 - Karl Stroetmann, Thomas Glaß:
A Declarative Semantics for the Prolog Cut Operator. 255-271 - Olof Torgersson:
A Definitional Approach to Functional Logic Programming. 273-287 - Peter Vojtás, Leonard Paulík:
Soundness and Completeness of Non-classical SLD-Resolution. 289-301 - Cees Witteveen, Wiebe van der Hoek:
Some postulates for Nonmonotonic Theory Revision Applied to Logic Programming. 303-318
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-01 23:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
