-
1
-
-
0348155880
-
Uniform equivalence of logic programs under the stable model semantics
-
Springer
-
T. Eiter and M. Fink. Uniform equivalence of logic programs under the stable model semantics. In Proc. ICLP 2003, Vol. 2916 in LNCS, pg. 224-238. Springer, 2003.
-
(2003)
Proc. ICLP 2003, Vol. 2916 in LNCS
, pp. 224-238
-
-
Eiter, T.1
Fink, M.2
-
2
-
-
34547509865
-
Semantical characterizations and complexity of equivalences in stable logic programming
-
To appear
-
T. Eiter, M. Fink, and S. Woltran. Semantical characterizations and complexity of equivalences in stable logic programming. ACM Transactions on Computational Logic, 2007. To appear.
-
(2007)
ACM Transactions on Computational Logic
-
-
Eiter, T.1
Fink, M.2
Woltran, S.3
-
3
-
-
84880748819
-
On solution correspondences in answer-set programming
-
T. Eiter, H. Tompits, and S. Woltran: On solution correspondences in answer-set programming. In Proc. IJCAI 2005, pg. 97-102, 2005.
-
(2005)
Proc. IJCAI 2005
, pp. 97-102
-
-
Eiter, T.1
Tompits, H.2
Woltran, S.3
-
5
-
-
33646041309
-
Answer sets for propositional theories
-
Springer
-
P. Ferraris. Answer sets for propositional theories. In Proc. LPNMR 2005, Vol. 3662 in LNCS, pg. 119-131. Springer, 2005.
-
(2005)
Proc. LPNMR 2005, Vol. 3662 in LNCS
, pp. 119-131
-
-
Ferraris, P.1
-
6
-
-
9444257668
-
Intuitionistic logic with strong negation
-
Y. Gurevich. Intuitionistic logic with strong negation. Studia Logica, 36(1-2): 49-59, 1977.
-
(1977)
Studia Logica
, vol.36
, Issue.1-2
, pp. 49-59
-
-
Gurevich, Y.1
-
7
-
-
22944478382
-
Equivalence of logic programs under updates
-
Springer
-
K. Inoue and C. Sakama. Equivalence of logic programs under updates. In Proc. JELIA 2004, Vol. 3229 of LNCS, pg. 174-186. Springer, 2004.
-
(2004)
Proc. JELIA 2004, Vol. 3229 of LNCS
, pp. 174-186
-
-
Inoue, K.1
Sakama, C.2
-
8
-
-
84880742309
-
Equivalence in abductive logic
-
K. Inoue and C. Sakama. Equivalence in abductive logic. In Proc. IJCAI 2005, pg. 472-477, 2005.
-
(2005)
Proc. IJCAI 2005
, pp. 472-477
-
-
Inoue, K.1
Sakama, C.2
-
9
-
-
67349285002
-
On abductive equivalence
-
L. Magnani (ed) College Publications, London
-
K. Inoue and C. Sakama. On abductive equivalence. In L. Magnani (ed), Model-Based Reasoning in Science and Engineering. Cognitive Science, Epistemology, Logic, Studies in Logic, pg. 333-352, College Publications, London, 2006.
-
(2006)
Model-Based Reasoning in Science and Engineering. Cognitive Science, Epistemology, Logic, Studies in Logic
, pp. 333-352
-
-
Inoue, K.1
Sakama, C.2
-
10
-
-
54649084682
-
On extensions of intermediate logics by strong negation
-
M. Kracht. On extensions of intermediate logics by strong negation. Journal of Philosophical Logic, 27(1): 49-73, 1998.
-
(1998)
Journal of Philosophical Logic
, vol.27
, Issue.1
, pp. 49-73
-
-
Kracht, M.1
-
11
-
-
84945953994
-
Strongly equivalent logic programs
-
V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2(4): 526-541, 2001.
-
(2001)
ACM Transactions on Computational Logic
, vol.2
, Issue.4
, pp. 526-541
-
-
Lifschitz, V.1
Pearce, D.2
Valverde, A.3
-
14
-
-
9444288708
-
Uniform equivalence for equilibrium logic and logic programs
-
Springer
-
D. Pearce and A. Valverde. Uniform equivalence for equilibrium logic and logic programs. In Proc. LPNMR 2004, Vol. 2923 of LNCS, pg. 194-206. Springer, 2004.
-
(2004)
Proc. LPNMR 2004, Vol. 2923 of LNCS
, pp. 194-206
-
-
Pearce, D.1
Valverde, A.2
-
15
-
-
84864208682
-
Strong equivalence for logic programs and default theories (made easy)
-
Springer
-
H. Turner. Strong equivalence for logic programs and default theories (made easy). In Proc. LPNMR 2001, Vol. 2173 of LNCS, pg. 81-92. Springer, 2001.
-
(2001)
Proc. LPNMR 2001, Vol. 2173 of LNCS
, pp. 81-92
-
-
Turner, H.1
-
17
-
-
9444226043
-
A constructive propositional calculus with strong negation (in Russian)
-
N. N. Vorob'ev. A constructive propositional calculus with strong negation (in Russian). Doklady Akademii Nauk SSR, 85: 465-468, 1952.
-
(1952)
Doklady Akademii Nauk SSR
, vol.85
, pp. 465-468
-
-
Vorob'ev, N.N.1
-
18
-
-
9444232374
-
The problem of deducibility in constructive propositional calculus with strong negation (in Russian)
-
N. N. Vorob'ev. The problem of deducibility in constructive propositional calculus with strong negation (in Russian). Doklady Akademii Nauk SSR, 85: 689-692, 1952.
-
(1952)
Doklady Akademii Nauk SSR
, vol.85
, pp. 689-692
-
-
Vorob'ev, N.N.1
-
19
-
-
22944481869
-
Characterizations for relativized notions of equivalence in answer set programming
-
Springer
-
S. Woltran. Characterizations for relativized notions of equivalence in answer set programming. In Proc. JELIA 2004, Vol. 3229 of LNCS, pg. 161-173. Springer, 2004.
-
(2004)
Proc. JELIA 2004, Vol. 3229 of LNCS
, pp. 161-173
-
-
Woltran, S.1
|