On kernels, defaults and even graphs
From MaRDI portal
Publication:1370591
DOI10.1023/A:1018972125742zbMATH Open0880.68122OpenAlexW1590977969MaRDI QIDQ1370591FDOQ1370591
Yannis Dimopoulos, Vangelis F. Magirou, Christos Papadimitriou
Publication date: 26 October 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018972125742
Cited In (9)
- Counting kernels in directed graphs with arbitrary orientations
- Kernels, truth and satisfaction
- Finding kernels or solving SAT
- Kernels in digraphs that are not kernel perfect
- Looking-ahead in backtracking algorithms for abstract argumentation
- Default theories that always have extensions
- Graph theoretical structures in logic programs and default theories
- Propositional discourse logic
- On kernel inclusions
This page was built for publication: On kernels, defaults and even graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370591)