
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
V.s. Subrahmanian, Dana Nau, Carlo Vago, "WFS + Branch and Bound = Stable Models," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 3, pp. 362377, June, 1995.  
BibTex  x  
@article{ 10.1109/69.390244, author = {V.s. Subrahmanian and Dana Nau and Carlo Vago}, title = {WFS + Branch and Bound = Stable Models}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {7}, number = {3}, issn = {10414347}, year = {1995}, pages = {362377}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.390244}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  WFS + Branch and Bound = Stable Models IS  3 SN  10414347 SP362 EP377 EPD  362377 A1  V.s. Subrahmanian, A1  Dana Nau, A1  Carlo Vago, PY  1995 KW  Logic programming KW  deductive databases KW  nonmonotonic reasoning KW  negation by failure. VL  7 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] K. Apt, H.A. Blair, and A. Walker, "Towards a Theory of Declarative Knowledge," Foundations of Deductive Databases and Logic Programming, J. Minker, ed., pp. 89148. Morgan Kaufmann, 1988.
[2] C. Baral and V.S. Subrahmanian,“Stable and extension class theory for logic programs and default logics,” J. Automated Reasoning, vol. 8, pp. 345366, 1992.
[3] C. Baral and V.S. Subrahmanian,“Dualities between alternative semantics for logic programming and nonmonotonic reasoning,” J. Automated Reasoning, vol. 10, pp. 399420, 1993.
[4] C. Bell,A. Nerode,R. Ng,, and V.S. Subrahmanian,“Implementing deductive databases by linear programming,” accepted for publication in ACM Trans. Database Systems.
[5] C. Bell, A. Nerode, R.T. Ng, and V.S. Subrahmanian, "Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases," J. ACM, vol. 41, no. 6, pp. 1,1781,215, 1994.
[6] W. Chen and D.S. Warren,“A practical approach to computing the wellfounded semantics,” Proc. 1992 Int’l Conf. Logic Programming, Nov. 1992.
[7] M.C. Fitting,“A KripkeKleene semantics for logic programming,” J. Logic Programming, vol. 4, pp. 295312, 1985.
[8] M. Gelfond and V. Lifschitz,“The stable model semantics for logic programming,” Proc. Fifth Int’l Conf. and Symp. on Logic Programming, R.A. Kowalski and K.A. Bowen, eds., pp. 1,0701,080, 1988.
[9] G. Gottlob,S. Marcus,A. Nerode,, and V.S. Subrahmanian,“Nonground stable and wellfounded demantics,” manuscript in preparation, 1993.
[10] V. Kagan,A. Nerode,, and V.S. Subrahmanian,“Computing definite logic programs by partial instantiation,” Annals of Pure and Applied Logic, vol. 67, pp. 161182, 1993.
[11] V. Kagan,A. Nerode,, and V.S. Subrahmanian,“Computing minimal models by partial instantiation,” 1993, accepted for publication in Theoretical Computer Science.
[12] D. Kemp,P.J. Stuckey,, and D. Srivastava,“Magic sets and bottomup evaluation of wellfounded models,” Proc. 1991 Int’l Logic Programming Symp., V. Saraswat and K. Ueda, eds., pp. 337351, MIT Press, 1991.
[13] D.E. Knuth, The Art of Computer Programming, vol. 1,Addison Wesley, second ed. 1973.
[14] N. Leone and P. Rullo,“Safe computation of the wellfounded semantics of DATALOG queries,” Information Systems, vol. 17, no. 1, 1992.
[15] N. Leone,M. Romeo,P. Rullo,, and D. Sacca,“Effective implementation of negation in database logic query languages,” LOGIDATA+: Deductive Databases with Complex Objects, LNCS vol. 701, pp. 159175, Springer, 1993.
[16] J.W. Lloyd, Foundations of Logic Programming, Springer Series in Symbolic Computation, second ed. New York: SpringerVerlag, 1987.
[17] W. Marek and M. Truszczynski,“Stable semantics for logic programs and default theories,” Proc. 1989 North Am. Conf. Logic Programming, E. Lusk and R. Overbeek, eds., pp. 243256, MIT Press, 1989.
[18] D. Saccà and C. Zaniolo, "Stable Models and Nondeterminism for Logic Programs with Negation," ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems, pp. 205217, 1990.
[19] V.S. Subrahmanian,D.S. Nau,, and C. Vago,“WFS + branch and bound = stable models,” Tech. Report CSTR2935, July 1992, Univ. of Maryland. Tech. report version of this paper.
[20] A. van Gelder, "The Alternating Fixpoint of Logic Programs with Negation," Proc. ACM Symp. Principles of Database Systems, pp. 110, 1989.
[21] A. van Gelder, K. Ross, and J. Schlipf, "Unfounded Sets and Wellfounded Semantics for General Logic Programs," Proc. Symp. Principles of Database Systems, pp. 221230, 1988.
[22] D.S. Warren,“Computing the wellfounded semantics of logic programs,” SUNY Stonybrook Tech. Report TR 9112, June 1991.