Graph theoretical structures in logic programs and default theories

[1]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[2]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[3]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[4]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[5]  Hortensia Galeana-Sánchez,et al.  On kernels and semikernels of digraphs , 1984, Discret. Math..

[6]  Pierre Duchet,et al.  A sufficient condition for a digraph to be kernel-perfect , 1987, J. Graph Theory.

[7]  V. Lifschitz,et al.  The Stable Model Semantics for Logic Programming , 1988, ICLP/SLP.

[8]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[9]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

[10]  Kenneth Kunen,et al.  Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[11]  Hector Geffner,et al.  A Framework for Reasoning with Defaults , 1990 .

[12]  Carlo Zaniolo,et al.  Stable models and non-determinism in logic programs with negation , 1990, PODS.

[13]  Ioan Tomescu,et al.  Almost all digraphs have a kernel , 1990, Discret. Math..

[14]  Teodor C. Przymusinski.  Extended Stable Semantics for Normal and Disjunctive Programs , 1990, ICLP.

[15]  Taisuke Sato,et al.  Completed Logic Programs and their Consistency , 1990, J. Log. Program..

[16]  Wenceslas Fernandez de la Vega.  Kernels in random graphs , 1990, Discret. Math..

[17]  Claude Berge,et al.  Recent problems and results about kernels in directed graphs , 1991, Discret. Math..

[18]  Teodor C. Przymusinski.  Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs , 1991, Artif. Intell..

[19]  Christine Froidevaux,et al.  General Logical Databases and Programs: Default Logic Semantics and Stratification , 1991, Inf. Comput..

[20]  Paolo Mancarella,et al.  Negation as Stable Hypotheses , 1991, LPNMR.

[21]  Marco Schaerf,et al.  Approximate Entailment , 1991, AI*IA.

[22]  Torsten Schaub.  On Commitment and Cumulativity in Default Logics , 1991, ECSQARU.

[23]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[24]  Gerhard Brewka.  Cumulative Default Logic: In Defense of Nonmonotonic Inference Rules , 1991, Artif. Intell..

[25]  Christine Froidevaux,et al.  A Framework for Default Logics , 1992, JELIA.

[26]  Antonis C. Kakas,et al.  Default Reasoning via Negation as Failure , 1992, ECAI Workshop on Knowledge Representation and Reasoning.

[27]  Mihalis Yannakakis,et al.  Tie-breaking semantics and structural totality , 1992, PODS '92.

[28]  José Júlio Alferes,et al.  Default Theory for Well Founded Semantics with Explicit Negation , 1992, JELIA.

[29]  Hortensia Galeana-Sánchez,et al.  On the existence of kernels and h-kernels in directed graphs , 1992, Discret. Math..

[30]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.

[31]  Alberto Torres.  Negation as Failure to Support , 1993, LPNMR.

[32]  Francesca Toni,et al.  An Assumption-Based Framework for Non-Monotonic Reasoning , 1993, LPNMR.

[33]  Marco Schaerf,et al.  A Survey of Complexity Results for Nonmonotonic Logics , 1993, J. Log. Program..

[34]  Teodor C. Przymusinski,et al.  Stationary Default Extensions , 1994, Fundam. Informaticae.

[35]  Alberto Torres.  The hypothetical semantics of logic programs , 1994 .

[36]  Marco Schaerf,et al.  Approximate Inference in Default Logic and Circumscription , 1992, Fundam. Informaticae.

[37]  Yannis Dimopoulos,et al.  A Graph-Theoretic Approach to Default Logic , 1994, Inf. Comput..

[38]  Yannis Dimopoulos.  Classical Methods in Nonmonotonic Reasoning , 1994, ISMIS.

[39]  H. Galeana-Sánchez.  On claw-free M -oriented critical kernel-imperfect digraphs , 1996 .