On kernels, defaults and even graphs

DOI10.1023/A:1018972125742MaRDI QIDQ1370591zbMATH OpenOpenAlexFDO

Authors Yannis Dimopoulos, Christos Papadimitriou, Vangelis F. Magirou

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

zbMATH Keywords

default theories

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• A graph-theoretic approach to default logic
• Graph theoretical structures in logic programs and default theories
• scientific article; zbMATH DE number 5198305
• scientific article; zbMATH DE number 1876863

Cited in

(11)

• A graph-theoretic approach to default logic
• Default theories that always have extensions
• Looking-ahead in backtracking algorithms for abstract argumentation
• Finding kernels or solving SAT
• Kernels in digraphs that are not kernel perfect
• Propositional discourse logic
• Enumeration of preferred extensions in almost oriented digraphs
• Kernels, truth and satisfaction
• On kernel inclusions
• Counting kernels in directed graphs with arbitrary orientations
• Graph theoretical structures in logic programs and default theories

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)