On the query complexity of selecting minimal sets for monotone predicates

&
Artificial Intelligence 233 (C):73-83 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2016.01.002

Links

PhilArchive



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

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

Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
Minimal sets on propositional formulae. Problems and reductions.Joao Marques-Silva, Mikoláš Janota & Carlos Mencía - 2017 - Artificial Intelligence 252 (C):22-50.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.
Effective Search Problems.Martin Kummer & Frank Stephan - 1994 - Mathematical Logic Quarterly 40 (2):224-236.
Cardinal invariants of monotone and porous sets.Michael Hrušák & Ondřej Zindulka - 2012 - Journal of Symbolic Logic 77 (1):159-173.
Immunity and Hyperimmunity for Sets of Minimal Indices.Frank Stephan & Jason Teutsch - 2008 - Notre Dame Journal of Formal Logic 49 (2):107-125.
On the computational power of random strings.Adam R. Day - 2009 - Annals of Pure and Applied Logic 160 (2):214-228.
Algorithms for computing minimal equivalent subformulas.Anton Belov, Mikoláš Janota, Inês Lynce & Joao Marques-Silva - 2014 - Artificial Intelligence 216:309-326.
Expansion of a model of a weakly o-minimal theory by a family of unary predicates.Bektur Sembiuly Baizhanov - 2001 - Journal of Symbolic Logic 66 (3):1382-1414.
Expansion of a model of a weakly o-minimal theory by a family of unary predicates.Bektur Sembiuly Baizhanov - 2001 - Journal of Symbolic Logic 66 (3):1382-1414.
Proofs with monotone cuts.Emil Jeřábek - 2012 - Mathematical Logic Quarterly 58 (3):177-187.
Minimal predicates, fixed-points, and definability.Johan van Benthem - 2005 - Journal of Symbolic Logic 70 (3):696-712.
Minimal Predicates. Fixed-Points, and Definability.Johan Van Benthem - 2005 - Journal of Symbolic Logic 70 (3):696 - 712.
Adaptive logics using the minimal abnormality strategy are P 1 1 \pi^1_1 -complex.Peter Verdée - 2009 - Synthese 167 (1):93 - 104.
Monotone Proofs of the Pigeon Hole Principle.R. Gavalda, A. Atserias & N. Galesi - 2001 - Mathematical Logic Quarterly 47 (4):461-474.

Analytics

Added to PP
2020-12-22

Downloads
6 (#1,425,536)

6 months
6 (#522,885)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations

References found in this work

Removing redundancy from a clause.Georg Gottlob & Christian G. Fermüller - 1993 - Artificial Intelligence 61 (2):263-289.

Add more references