On the tractability of minimal model computation for some CNF theories

, , &
Artificial Intelligence 210 (C):56-77 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2014.02.003

Links

PhilArchive



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

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

Outlier detection for simple default theories.Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary & Luigi Palopoli - 2010 - Artificial Intelligence 174 (15):1247-1253.
Outlier detection using default reasoning.Fabrizio Angiulli, Rachel Ben-Eliyahu – Zohary & Luigi Palopoli - 2008 - Artificial Intelligence 172 (16-17):1837-1872.
Reasoning with minimal models: efficient algorithms and applications.Rachel Ben-Eliyahu-Zohary & Luigi Palopoli - 1997 - Artificial Intelligence 96 (2):421-449.
Forking in VC-minimal theories.Sarah Cotter & Sergei Starchenko - 2012 - Journal of Symbolic Logic 77 (4):1257-1271.
Beyond Formal Structure: A Mechanistic Perspective on Computation and Implementation.Marcin Miłkowski - 2011 - Journal of Cognitive Science 12 (4):359-379.
For a Few Neurons More: Tractability and Neurally Informed Economic Modelling.Matteo Colombo - 2015 - British Journal for the Philosophy of Science 66 (4):713-736.
Bounded fixed-parameter tractability and reducibility.Rod Downey, Jörg Flum, Martin Grohe & Mark Weyer - 2007 - Annals of Pure and Applied Logic 148 (1):1-19.
New spectra of strongly minimal theories in finite languages.Uri Andrews - 2011 - Annals of Pure and Applied Logic 162 (5):367-372.
Neural Computation and the Computational Theory of Cognition.Gualtiero Piccinini & Sonya Bahar - 2013 - Cognitive Science 37 (3):453-488.
An incremental algorithm for generating all minimal models.Rachel Ben-Eliyahu – Zohary - 2005 - Artificial Intelligence 169 (1):1-22.
Minimum models of second-order set theories.Kameryn J. Williams - 2019 - Journal of Symbolic Logic 84 (2):589-620.
Explaining computation without semantics: Keeping it simple.Nir Fresco - 2010 - Minds and Machines 20 (2):165-181.
omnibus Review. [REVIEW]Ehud Hrushovski - 1993 - Journal of Symbolic Logic 58 (2):710-713.
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.
[Omnibus Review].Ehud Hrushovski - 1993 - Journal of Symbolic Logic 58 (2):710-713.

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,469,565)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.
A logic for default reasoning.Ray Reiter - 1980 - Artificial Intelligence 13 (1-2):81-137.
Characterizing diagnoses and systems.Johan de Kleer, Alan K. Mackworth & Raymond Reiter - 1992 - Artificial Intelligence 56 (2-3):197-222.

View all 6 references / Add more references