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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 97,297

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

On the equivalence of optimal recommendation sets and myopically optimal query sets.Paolo Viappiani & Craig Boutilier - 2020 - Artificial Intelligence 286 (C):103328.
Optimal query complexity bounds for finding graphs.Sung-Soon Choi & Jeong Han Kim - 2010 - Artificial Intelligence 174 (9-10):551-569.
Data complexity of query answering in description logics.Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini & Riccardo Rosati - 2013 - Artificial Intelligence 195 (C):335-360.
Datalog rewritability and data complexity of ALCHOIQ with closed predicates.Sanja Lukumbuzya, Magdalena Ortiz & Mantas Šimkus - 2024 - Artificial Intelligence 330 (C):104099.
Minimal sets on propositional formulae. Problems and reductions.Joao Marques-Silva, Mikoláš Janota & Carlos Mencía - 2017 - Artificial Intelligence 252 (C):22-50.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
On the incompatibility of faithfulness and monotone DAG faithfulness.David Maxwell Chickering & Christopher Meek - 2006 - Artificial Intelligence 170 (8-9):653-666.
Controlled query evaluation in description logics through consistent query answering.Gianluca Cima, Domenico Lembo, Riccardo Rosati & Domenico Fabio Savo - 2024 - Artificial Intelligence 334 (C):104176.
Author's query.NancyJ Kanter - 1980 - Artificial Intelligence 14 (3):315.
Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms.Chao Qian, Yang Yu, Ke Tang, Xin Yao & Zhi-Hua Zhou - 2019 - Artificial Intelligence 275 (C):279-294.

Analytics

Added to PP
2020-12-22

Downloads
12 (#1,259,565)

6 months
9 (#693,854)

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