On strongest necessary and weakest sufficient conditions☆☆An earlier version of this paper was the co-winner of the Best Paper Award at KR2000

Artificial Intelligence 128 (1-2):143-159 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(01)00070-4

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,070

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

Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions.Patrick Doherty & Andrzej Szałas - 2024 - Artificial Intelligence 326 (C):104036.
Photo-Opportunity.Patrick Maynard - 1991 - Canadian Review of American Studies 22 (3):501-528.
Winner Of The Gerrit And Edith Schipper Award For Outstanding Undergraduate Paper: "towards A Procedural Deontology".Christian Williams - 2003 - Florida Philosophical Review 3 (1):45-58.
Judgements of Co-Identification.Stacie Friend - forthcoming - In Alex Grzankowski & Anthony Savile (eds.), Thought: its Origin and Reach. Essays in Honour of Mark Sainsbury. Routledge.
Querying temporal and spatial constraint networks in PTIME☆☆A preliminary version of this paper appeared in the proceedings of AAAI-99. A different version of this paper (aimed at a database audience) appeared in the proceedings of the workshop STDBM99. [REVIEW]Manolis Koubarakis & Spiros Skiadopoulos - 2000 - Artificial Intelligence 123 (1-2):223-263.
The Logical vs. the Ontological Understanding of Conditions.Rögnvaldur Ingthorsson - 2008 - Metaphysica 9 (2):129-137.
Preference elicitation and robust winner determination for single- and multi-winner social choice.Tyler Lu & Craig Boutilier - 2020 - Artificial Intelligence 279 (C):103203.
Biosemiotic Achievement Award for the Year 2021.Alin Olteanu & Vinicius Romanini - 2022 - Biosemiotics 15 (3):395-399.
A logic-based theory of deductive arguments☆☆This is an extended version of a paper entitled “Towards a logic-based theory of argumentation” published in the Proceedings of the National Conference on Artificial Intelligence (AAAI'2000), Austin, TX, MIT Press, Cambridge, MA, 2000. [REVIEW]Philippe Besnard & Anthony Hunter - 2001 - Artificial Intelligence 128 (1-2):203-235.
Exploiting symmetries within constraint satisfaction search☆☆This paper is an extended and updated version of [16], presented at the IJCAI-99 conference. [REVIEW]Pedro Meseguer & Carme Torras - 2001 - Artificial Intelligence 129 (1-2):133-163.

Analytics

Added to PP
2020-12-22

Downloads
4 (#1,646,947)

6 months
3 (#1,209,684)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Knowledge forgetting: Properties and applications.Yan Zhang & Yi Zhou - 2009 - Artificial Intelligence 173 (16-17):1525-1537.
Semantic forgetting in answer set programming.Thomas Eiter & Kewen Wang - 2008 - Artificial Intelligence 172 (14):1644-1672.
On propositional definability.Jérôme Lang & Pierre Marquis - 2008 - Artificial Intelligence 172 (8-9):991-1017.

View all 7 citations / Add more citations

References found in this work

How to progress a database.Fangzhen Lin & Ray Reiter - 1997 - Artificial Intelligence 92 (1-2):131-167.
Abduction versus closure in causal theories.Kurt Konolige - 1992 - Artificial Intelligence 53 (2-3):255-272.

Add more references