Negation as failure

&
Artificial Intelligence 30 (3):273-287 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(86)90001-9

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,597

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Minimal belief and negation as failure.Vladimir Lifschitz - 1994 - Artificial Intelligence 70 (1-2):53-72.
On the relationship between circumscription and negation as failure.Michael Gelfond, Halina Przymusinska & Teodor Przymusinski - 1989 - Artificial Intelligence 38 (1):75-94.
The justification of negation as failure.J. E. Fenstad - 1989 - In Jens Erik Fenstad, Ivan Timofeevich Frolov & Risto Hilpinen (eds.), Logic, methodology, and philosophy of science VIII: proceedings of the Eighth International Congress of Logic, Methodology, and Philosophy of Science, Moscow, 1987. New York, NY, U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science.
Belnap's epistemic states and negation-as-failure.Gerd Wagner - 1996 - In Heinrich Wansing (ed.), Negation: a notion in focus. New York: W. de Gruyter. pp. 7--233.
Negation – failure or success? Remarks on an Allegedly Characteristic Trait of Dharmakīrti's Anupalabdhi- Theory.Birgit Kellner - 2001 - Journal of Indian Philosophy 29 (5/6):495-517.
Nonmonotonic reasoning and modal logic, from negation as failure to default logic.Philippe Balbiani - 1991 - In Bernadette Bouchon-Meunier, Ronald R. Yager & Lotfi A. Zadeh (eds.), Uncertainty in Knowledge Bases: 3rd International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU'90, Paris, France, July 2 - 6, 1990. Proceedings. Springer. pp. 223--231.
Definite Formulae, Negation-as-Failure, and the Base-Extension Semantics of Intuitionistic Propositional Logic.Alexander V. Gheorghiu & David J. Pym - 2023 - Bulletin of the Section of Logic 52 (2):239-266.
Review: Y. N. Moschovakis, Logic from computer science, Proceedings of a workshop held November 13-17 1989; , Logics for Negation as Failure. [REVIEW]Helmut Schwichtenberg - 1995 - Journal of Symbolic Logic 60 (3):1021-1022.
Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. Logic programming, Proceedings of the fifth international conference and symposium, Volume 2, edited by Robert A. Kowalski and Kenneth A. Bowen, Series in logic programming, The MIT Press, Cambridge, Mass., and London, 1988, pp. 1070–1080. - Kit Fine. The justification of negation as failure. Logic, methodology and philosophy of science VIII, Proceedings of the Eighth International Congress of Logic, Methodology and Philosophy of Science, Moscow, 1987, edited by Jens Erik Fenstad, Ivan T. Frolov, and Risto Hilpinen, Studies in logic and the foundations of mathematics, vol. 126, North-Holland, Amsterdam etc. 1989, pp. 263–301. [REVIEW]Melvin Fitting - 1992 - Journal of Symbolic Logic 57 (1):274-277.

Analytics

Added to PP
2020-12-22

Downloads
11 (#1,423,075)

6 months
6 (#873,397)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

An algorithm to compute circumscription.Teodor C. Przymusinski - 1989 - Artificial Intelligence 38 (1):49-73.

View all 8 citations / Add more citations

References found in this work

On the satisfiability of circumscription.Vladimir Lifschitz - 1986 - Artificial Intelligence 28 (1):17-27.

Add more references