Linear resolution for consequence finding

Artificial Intelligence 56 (2-3):301-353 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(92)90030-2

Other Versions

No versions found

Links

PhilArchive

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

A note on linear resolution strategies in consequence-finding.Eliana Minicozzi & Raymond Reiter - 1972 - Artificial Intelligence 3 (C):175-180.
Linear resolution with selection function.Robert Kowalski & Donald Kuehner - 1971 - Artificial Intelligence 2 (3-4):227-260.
Resolution graphs.Robert A. Yates, Bertram Raphael & Timothy P. Hart - 1970 - Artificial Intelligence 1 (3-4):257-289.
Relational linear programming.Kristian Kersting, Martin Mladenov & Pavel Tokmakov - 2017 - Artificial Intelligence 244 (C):188-216.
Resolution for Max-SAT.María Luisa Bonet, Jordi Levy & Felip Manyà - 2007 - Artificial Intelligence 171 (8-9):606-618.
A resolution principle for constrained logics.Hans-Jürgen Bürckert - 1994 - Artificial Intelligence 66 (2):235-271.
Low resolution gait recognition with high frequency super resolution.Junping Zhang, Yuan Cheng & Changyou Chen - 2008 - In Tu-Bao Ho & Zhi-Hua Zhou, PRICAI 2008: Trends in Artificial Intelligence. Springer. pp. 533--543.
Non-resolution theorem proving.W. W. Bledsoe - 1977 - Artificial Intelligence 9 (1):1-35.
Analytic resolution in theorem proving.D. Brand - 1976 - Artificial Intelligence 7 (4):285-318.
A theory of conflict resolution in planning.Qiang Yang - 1992 - Artificial Intelligence 58 (1-3):361-392.

Analytics

Added to PP
2020-12-22

Downloads
38 (#1,418,604)

6 months
9 (#1,250,161)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Metatheory of Actions: Beyond Consistency.Andreas Herzig & Ivan Varzinczak - 2007 - Artificial Intelligence 171 (1):951–984.
Embedding Logics in the Local Computation Framework.Nic Wilson & Jérôme Mengin - 2001 - Journal of Applied Non-Classical Logics 11 (3):239-267.

View all 14 citations / 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 logical framework for default reasoning.David Poole - 1988 - Artificial Intelligence 36 (1):27-47.
An assumption-based TMS.Johan de Kleer - 1986 - Artificial Intelligence 28 (2):127-162.
Linear resolution with selection function.Robert Kowalski & Donald Kuehner - 1971 - Artificial Intelligence 2 (3-4):227-260.

View all 10 references / Add more references