default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Logic and Computation, Volume 2
Volume 2, Number 1, March 1992
- Michael Gelfond
:
Editorial. 1-4 - Valentin Goranko, Solomon Passy:
Using the Universal Modality: Gains and Questions. 5-30 - Mario R. F. Benevides, T. S. E. Maibaum:
A Constructive Presentation for the Modal Connective of Necessity (\Box). 31-50 - Arnon Avron:
Axiomatic Systems, Deduction and Implication. 51-98
Volume 2, Number 2, May 1992
- Melvin Fitting:
Editorial. 107-110 - Jean-Yves Girard:
Logic and Exceptions: A Few Remarks. 111-118 - Manfred Droste:
Finite Axiomatizations for Universal Domains. 119-131 - Els Laenens, Dirk Vermeir:
Assumption-Free Semantics for Ordered Logic Programs: On the Relationship between Well-Founded and Stable Partial Models. 133-172 - E. Allen Emerson, Tom Sadler, Jai Srinivasan:
Efficient Temporal Satisfiability. 173-210 - Dirk Roorda:
Proof Nets for Lambek Calculus. 211-231
Volume 2, Number 3, June 1992
- T. S. E. Maibaum:
Editorial. 243-245 - Yves Auffray, Patrice Enjalbert:
Modal Theorem Proving: An Equational Viewpoint. 247-295 - Jean-Marc Andreoli:
Logic Programming with Focusing Proofs in Linear Logic. 297-347 - Melvin Fitting, V. Wiktor Marek, Miroslaw Truszczynski:
The Pure Logic of Necessitation. 349-373 - Felipe Cucker:
The Arithmetical Hierarchy over the Reals. 375-395 - Georg Gottlob:
Complexity Results for Nonmonotonic Logics. 397-425
Volume 2, Number 4, August 1992
- Chris Hankin:
Editorial. 437-439 - Hanne Riis Nielson, Flemming Nielson:
Bounded Fixed-Point Iteration. 441-464 - John Hughes, John Launchbury:
Relational Reversal of Abstract Interpretation. 465-482 - Simon Hughes:
Compile-Time Garbage Collection for Higher-Order Functional Languages. 483-509 - Patrick Cousot, Radhia Cousot:
Abstract Interpretation Frameworks. 511-547
Volume 2, Number 5, October 1992
- Maarten H. van Emden:
Editorial: Rhetoric versus Modernism in Computing. 551-555 - A. W. Roscoe:
An Alternative Order for the Failures Model. 557-577 - Fairouz Kamareddine:
Set Theory and Nominalization, Part I. 579-604 - Edmund M. Clarke, Orna Grumberg, Robert P. Kurshan:
A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems. 605-618 - Dan Sahlin, Torkel Franzén, Seif Haridi:
An Intuitionistic Predicate Logic Theorem Prover. 619-656
Volume 2, Number 6, December 1992
- Vladimir Lifschitz:
Editorial. 671-673 - Karl Schlechta:
Some Results on Classical Preferential Models. 675-686 - Fairouz Kamareddine:
Set Theory and Nominalization, Part II. 687-707 - Chris Brink, J. J. C. Vermeulen, J. P. G. Pretorius:
Verisimilitude via Vietoris. 709-718 - Antonis C. Kakas, Robert A. Kowalski, Francesca Toni:
Abductive Logic Programming. 719-770
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 2024-12-27 21:27 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:
