Gelfond–Zhang aggregates as propositional formulas

, , &
Artificial Intelligence 274 (C):26-43 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2018.10.007

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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

Vicious circle principle, aggregates, and formation of sets in ASP based languages.Michael Gelfond & Yuanlin Zhang - 2019 - Artificial Intelligence 275 (C):28-77.
Evaluation of propositional formulas from the viewpoint of computational complexity.Ivan Kramosil - 1988 - Bulletin of the Section of Logic 17 (2):62-66.
Measuring Inconsistency in Some Logics with Modal Operators.John Grant - 2020 - Studia Logica 109 (3):581-605.
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.
Examining fragments of the quantified propositional calculus.Steven Perron - 2008 - Journal of Symbolic Logic 73 (3):1051-1080.
On an interpretation of second order quantification in first order intuitionistic propositional logic.Andrew M. Pitts - 1992 - Journal of Symbolic Logic 57 (1):33-52.
A propositional fragment of leśniewski's ontology and its formulation by the tableau method.Mitsunori Kobayashi & Arata Ishimoto - 1982 - Studia Logica 41 (2-3):181 - 195.
The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete.Anatoly P. Beltiukov - 2001 - Annals of Pure and Applied Logic 113 (1-3):53-58.
A. Białynicki-Birula and H. Rasiowa. On constructible falsity in the constructive logic with strong negation. Colloquium mathematicum, vol. 6 (1958), pp. 287–310. [REVIEW]Gene F. Rose, V. A. Jankov, Sue Walker & Elliott Mendelson - 1970 - Journal of Symbolic Logic 35 (1):138-138.
Extendible Formulas in Two Variables in Intuitionistic Logic.Nick Bezhanishvili & Dick Jongh - 2012 - Studia Logica 100 (1-2):61-89.
Logics and algebras for multiple players.Loes Olde Loohuis & Yde Venema - 2010 - Review of Symbolic Logic 3 (3):485-519.
Paraconsistent sequential calculi.V. M. Popov - 1988 - Bulletin of the Section of Logic 17 (3/4):148-153.
Propositional consistency proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.
Measuring Inconsistency in Generalized Propositional Logic.John Grant - 2020 - Logica Universalis 14 (3):331-356.
Intuitionistic Predicate Logic with Decidable Propositional Formulas.Alexander Sakharov - 2007 - Reports on Mathematical Logic.

Analytics

Added to PP
2020-12-22

Downloads
14 (#956,614)

6 months
7 (#411,145)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

A logic for default reasoning.Ray Reiter - 1980 - Artificial Intelligence 13 (1-2):81-137.
Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.
Non-monotonic logic I.Drew McDermott & Jon Doyle - 1980 - Artificial Intelligence 13 (1-2):41-72.

View all 6 references / Add more references