-
1
-
-
85027488553
-
Two proof procedures for a cardinality based language in propositional calculus
-
IRISA
-
B. Benhamou, L. Saïs, and P. Siegel. Two proof procedures for a cardinality based language in propositional calculus. In STACS'94, pages 71-82. IRISA, 1994.
-
(1994)
STACS'94
, pp. 71-82
-
-
Benhamou, B.1
Saïs, L.2
Siegel, P.3
-
3
-
-
0000342173
-
Preferred subtheories: An extended logical framework for default reasoning
-
G. Brewka. Preferred subtheories: an extended logical framework for default reasoning. In IJCAI' 89, pages 1043-1048, 1989.
-
(1989)
IJCAI' 89
, pp. 1043-1048
-
-
Brewka, G.1
-
4
-
-
0031207583
-
On compact representations of propositional circumscription
-
PII S030439759600182X
-
M. Cadoli, F.M. Donini, M. Schaerf, and R. Silvestri. On compact representations of propositional circumscription. Theoretical Computer Science, 182:183-202, 1997. (Pubitemid 127455848)
-
(1997)
Theoretical Computer Science
, vol.182
, Issue.1-2
, pp. 183-202
-
-
Cadoli, M.1
Donini, F.M.2
Schaerf, M.3
Silvestri, R.4
-
5
-
-
84957619276
-
Non-monotonic syntax-based entailment: A classification of consequence relations
-
C. Cayrol and M.C. Lagasquie-Schiex. Non-monotonic syntax-based entailment: a classification of consequence relations. In ECSQARU'95, pages 107-114, 1995.
-
(1995)
ECSQARU'95
, pp. 107-114
-
-
Cayrol, C.1
Lagasquie-Schiex, M.C.2
-
6
-
-
22044455836
-
Nonmonotonic reasoning: From complexity to algorithms
-
C. Cayrol, M. Lagasquie-Schiex, and Th. Schiex. Nonmonotonic reasoning: from complexity to algorithms. Annals of Mathematics and Artificial Intelligence, 22(3-4):207-236, 1998.
-
(1998)
Annals of Mathematics and Artificial Intelligence
, vol.22
, Issue.3-4
, pp. 207-236
-
-
Cayrol, C.1
Lagasquie-Schiex, M.2
Schiex, Th.3
-
7
-
-
0011370635
-
The complexity of nested counterfactuals and iterated knowledge base revisions
-
Th. Eiter and G. Gottlob. The complexity of nested counterfactuals and iterated knowledge base revisions. In IJCAI'93, pages 526-531, 1993.
-
(1993)
IJCAI'93
, pp. 526-531
-
-
Eiter, Th.1
Gottlob, G.2
-
8
-
-
84985099004
-
Relating default logic and circumscription
-
D.V. Etherington. Relating default logic and circumscription. In IJCAI'87, pages 489-494, 1987.
-
(1987)
IJCAI'87
, pp. 489-494
-
-
Etherington, D.V.1
-
9
-
-
0020976571
-
On the semantics of updates in databases
-
R. Fagin, J. D. Ullman, and M. Y. Vardi. On the semantics of updates in databases. In PODS'83, pages 352-365, 1983.
-
(1983)
PODS'83
, pp. 352-365
-
-
Fagin, R.1
Ullman, J.D.2
Vardi, M.Y.3
-
10
-
-
0001015356
-
Propositional calculus for contradictory deductive systems
-
S. Jaśkowski. Propositional calculus for contradictory deductive systems. Studia Logica, 24:143-167, 1969.
-
(1969)
Studia Logica
, vol.24
, pp. 143-167
-
-
Jaśkowski, S.1
-
11
-
-
0347684760
-
Distance-based merging: A general framework and some complexity results
-
S. Konieczny, J. Lang, and P. Marquis. Distance-based merging: a general framework and some complexity results. In KR'02, pages 97-108, 2002.
-
(2002)
KR'02
, pp. 97-108
-
-
Konieczny, S.1
Lang, J.2
Marquis, P.3
-
12
-
-
22944460249
-
Logical connectives for non-monotonicity: A choice function-based approach
-
J. Mengin. Logical connectives for non-monotonicity: A choice function-based approach. In JELIA'2004, pages 452-461, 2004.
-
(2004)
JELIA'2004
, pp. 452-461
-
-
Mengin, J.1
-
13
-
-
0002182507
-
Belief revision and default reasoning: Syntax-based approaches
-
B. Nebel. Belief revision and default reasoning: Syntax-based approaches. In KR'91, pages 417-428, 1991.
-
(1991)
KR'91
, pp. 417-428
-
-
Nebel, B.1
-
15
-
-
0024066001
-
A logical framework for default reasoning
-
D. Poole. A logical framework for default reasoning. Artificial Intelligence, 36:27-47, 1988.
-
(1988)
Artificial Intelligence
, vol.36
, pp. 27-47
-
-
Poole, D.1
-
16
-
-
0000482243
-
On inference from inconsistent premises
-
N. Rescher and R. Manor. On inference from inconsistent premises. Theory and Decision, 1:179-219, 1970.
-
(1970)
Theory and Decision
, vol.1
, pp. 179-219
-
-
Rescher, N.1
Manor, R.2
|