Semi-equilibrium models for paracoherent answer set programs

Alcântara, 2004, A declarative characterization of disjunctive paraconsistent answer sets, 951 Amendola, 2014, Modular paracoherent answer sets, vol. 8761, 457 K. Apt, H. Blair, A. Walker, Towards a theory of declarative knowledge, in: Minker [36], pp. 89–148. Balduccini, 2003, Logic programs with consistency-restoring rules, 9 Baral, 1993, Dualities between alternative semantics for logic programming and nonmonotonic reasoning, J. Autom. Reason., 10, 399, 10.1007/BF00881799 Baral, 2003 2005, vol. 3662 Ben-Eliyahu, 1994, Propositional semantics for disjunctive logic programs, Ann. Math. Artif. Intell., 12, 53, 10.1007/BF01530761 Blair, 1989, Paraconsistent logic programming, Theor. Comput. Sci., 68, 135, 10.1016/0304-3975(89)90126-6 Brewka, 2007, Equilibria in heterogeneous nonmonotonic multi-context systems, 385 Brewka, 2011, Answer set programming at a glance, Commun. ACM, 54, 92, 10.1145/2043174.2043195 de Bruijn, 2010, A semantical framework for hybrid knowledge bases, Knowl. Inf. Syst., 25, 81, 10.1007/s10115-010-0294-z Cabalar, 2006, Logical foundations of well-founded semantics, 25 Cabalar, 2007, Partial equilibrium logic, Ann. Math. Artif. Intell., 50, 305, 10.1007/s10472-007-9075-0 Dao-Tran, 2009, Modular nonmonotonic logic programming revisited, vol. 5649, 145 Eiter, 1995, On the computational cost of disjunctive logic programming: propositional case, Ann. Math. Artif. Intell., 15, 289, 10.1007/BF01536399 Eiter, 2010, Paracoherent answer set programming, 486 Eiter, 2005, A uniform integration of higher-order reasoning and external evaluations in answer set programming, 90 Eiter, 1997, On the partial semantics for disjunctive deductive databases, Ann. Math. Artif. Intell., 19, 59, 10.1023/A:1018947420290 Faber, 2007, Magic sets and their application to data integration, J. Comput. Syst. Sci., 73, 584, 10.1016/j.jcss.2006.10.012 P. Ferraris, Answer sets for propositional theories, in: Baral et al. [7], pp. 119–131. Ferraris, 2005, Weight constraints as nested expressions, Theory Pract. Log. Program., 5, 45, 10.1017/S1471068403001923 Fink, 2012, Paraconsistent hybrid theories, 391 Gebser, 2012 Gebser, 2008, A meta-programming technique for debugging answer-set programs, 448 Gelfond, 1991, Classical negation in logic programs and disjunctive databases, New Gener. Comput., 9, 365, 10.1007/BF03037169 Heyting, 1930, Die formalen Regeln der intuitionistischen Logik, Sitz.ber. Preuss. Akad. Wiss., 16, 42 Huang, 2013, Reasoning with inconsistencies in hybrid MKNF knowledge bases, Log. J. IGPL, 21, 263, 10.1093/jigpal/jzs043 Janhunen, 2009, Modularity aspects of disjunctive stable models, J. Artif. Intell. Res., 35, 813, 10.1613/jair.2810 Kakas, 1990, Generalized stable models: a semantics for abduction, 385 Lifschitz, 1994, Splitting a logic program, 23 Lifschitz, 2001, Strongly equivalent logic programs, ACM Trans. Comput. Log., 2, 526, 10.1145/383779.383783 Lifschitz, 1999, Nested expressions in logic programs, Ann. Math. Artif. Intell., 25, 369, 10.1023/A:1018978005636 Lifschitz, 1992, Answer sets in general nonmonotonic reasoning (preliminary report), 603 Marek, 1999, Logic programs, well-orderings, and forward chaining, Ann. Pure Appl. Log., 96, 231, 10.1016/S0168-0072(98)00041-4 1988 S.P. Odintsov, D. Pearce, Routley semantics for answer sets, in: Baral et al. [7], pp. 343–355. Oetsch, 2012, Stepwise debugging of description-logic programs, vol. 7265, 492 Osorio, 2008, Logical weak completions of paraconsistent logics, J. Log. Comput., 18, 913, 10.1093/logcom/exn015 Pearce, 2006, Equilibrium logic, Ann. Math. Artif. Intell., 47, 3, 10.1007/s10472-006-9028-z Pearce, 2008, Quantified equilibrium logic and foundations for answer set programs, vol. 5366, 546 Pereira, 1992, Contradiction removal semantics with explicit negation, vol. 808, 91 Pereira, 2005, Revised stable models – a semantics for logic programs, vol. 3808, 29 Pereira, 2007, Approved models for normal logic programs, vol. 4790, 454 Pereira, 2009, Layered models top-down querying of normal logic programs, vol. 5418, 254 T.C. Przymusinski, On the declarative semantics of deductive databases and logic programs, in: Minker [36], pp. 193–216. Przymusinski, 1991, Stable semantics for disjunctive programs, New Gener. Comput., 9, 401, 10.1007/BF03037171 Saccà, 1991, Partial models and three-valued stable models in logic programs with negation, 87 Sakama, 1995, Paraconsistent stable semantics for extended disjunctive programs, J. Log. Comput., 5, 265, 10.1093/logcom/5.3.265 Sakama, 2003, An abductive framework for computing knowledge base updates, Theory Pract. Log. Program., 3, 671, 10.1017/S1471068403001716 Seipel, 1997, Partial evidential stable models for disjunctive deductive databases, vol. 1471, 66 Syrjänen, 2006, Debugging inconsistent Answer-Set Programs, 77 Tarjan, 1972, Depth-first search and linear graph algorithms, SIAM J. Comput., 1, 146, 10.1137/0201010 Turner, 2003, Strong equivalence made easy: nested expressions and weight constraints, Theory Pract. Log. Program., 3, 609, 10.1017/S1471068403001819 van Gelder, 1993, The alternating fixpoint of logic programs with negation, J. Comput. Syst. Sci., 47, 185, 10.1016/0022-0000(93)90024-Q van Gelder, 1991, The well-founded semantics for general logic programs, J. ACM, 38, 620, 10.1145/116825.116838 Wang, 2005, Comparisons and computation of well-founded semantics for disjunctive logic programs, ACM Trans. Comput. Log., 6, 295, 10.1145/1055686.1055690 Wang, 2009, Logic programs, compatibility and forward chaining construction, J. Comput. Sci. Technol., 24, 1125, 10.1007/s11390-009-9285-5 You, 1994, A three-valued semantics for deductive databases and logic programs, J. Comput. Syst. Sci., 49, 334, 10.1016/S0022-0000(05)80053-4