Ordering conjunctive queries

&
Artificial Intelligence 26 (2):171-215 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(85)90028-1

Links

PhilArchive



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

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

Relative difficulty of restricted-conjunctive and conjunctive concepts.P. L. Gardner - 1970 - Journal of Experimental Psychology 86 (2):211.
Against Conjunctive Properties.Michele Paolini Paoletti - 2020 - Acta Analytica 35 (3):421-437.
The or of free choice permission.R. E. Jennings - 1994 - Topoi 13 (1):3-10.
Exploring and extending the landscape of conjunctive approaches to verisimilitude.Gustavo Cevolani & Roberto Festa - 2018 - In Alessandro Giordani & Ciro de Florio (eds.), From Arithmetic to Metaphysics: A Path Through Philosophical Logic. De Gruyter. pp. 69-88.
A conjunction in closure spaces.Andrzej W. Jankowski - 1984 - Studia Logica 43 (4):341 - 351.
Describing I-junction.Paul M. Pietroski - 2014 - ProtoSociology 31:121-137.
Learning via queries and oracles.Frank Stephan - 1998 - Annals of Pure and Applied Logic 94 (1-3):273-296.
The methodological origins of Newton’s queries.Peter R. Anstey - 2004 - Studies in History and Philosophy of Science Part A 35 (2):247-269.
Conjunctive Explanations and Inference to the Best Explanation.Jonah Schupbach - 2019 - Teorema: International Journal of Philosophy 38 (3):143-162.
Queries and Confessions, with Illustr. Of 128 Varieties of Natural Grasses. Queries - 1883
Not every truth can be known (at least, not all at once).Greg Restall - 2009 - In Joe Salerno (ed.), New Essays on the Knowability Paradox. Oxford University Press. pp. 339--354.
The Settling-Time Reducibility Ordering.Barbara F. Csima & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (3):1055 - 1071.
Towards a characterization of order-invariant queries over tame graphs.Michael A. Benedikt & Luc Segoufin - 2009 - Journal of Symbolic Logic 74 (1):168-186.
On the expressibility and the computability of untyped queries.Jose Turull Torres - 2001 - Annals of Pure and Applied Logic 108 (1-3):345-371.
A general theorem on termination of rewriting.Jeremy E. Dawson - unknown

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,463,568)

6 months
5 (#526,961)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A circumscriptive theorem prover.Matthew L. Ginsberg - 1989 - Artificial Intelligence 39 (2):209-230.
Controlling backward inference.David E. Smith - 1989 - Artificial Intelligence 39 (2):145-208.
Acquiring search-control knowledge via static analysis.Oren Etzioni - 1993 - Artificial Intelligence 62 (2):255-301.

View all 7 citations / Add more citations

References found in this work

A truth maintenance system.Jon Doyle - 1979 - Artificial Intelligence 12 (3):231-272.
A logic for default reasoning.Ray Reiter - 1980 - Artificial Intelligence 13 (1-2):81-137.

Add more references