Graph theoretical structures in logic programs and default theories

DOI10.1016/S0304-3975(96)80707-9zbMath0874.68190MaRDI QIDQ672050

Yannis Dimopoulos, Alberto Torres

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

semanticsgraph representationlogic programdefault theories

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (45)

Backdoors to Satisfaction ⋮ Complexity of nonemptiness in control argumentation frameworks ⋮ On rejected arguments and implicit conflicts: the hidden power of argumentation semantics ⋮ Labellings for assumption-based and abstract argumentation ⋮ A nondeterministic well-founded semantics ⋮ Lattice point of view for argumentation framework ⋮ Improved answer-set programming encodings for abstract argumentation ⋮ The complexity landscape of claim-augmented argumentation frameworks ⋮ On the preferred extensions of argumentation frameworks: bijections with naive sets ⋮ Characteristics of multiple viewpoints in abstract argumentation ⋮ Finding kernels or solving SAT ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ Taking into account ``who said what in abstract argumentation: complexity results ⋮ Layerings of logic programs -- layer decomposable semantics and incremental model computation ⋮ Preferred extensions as stable models ⋮ Kernels in digraphs that are not kernel perfect ⋮ An extension-based approach to belief revision in abstract argumentation ⋮ Propositional discourse logic ⋮ Complexity-sensitive decision procedures for abstract argumentation ⋮ Verification in incomplete argumentation frameworks ⋮ Acceptance in incomplete argumentation frameworks ⋮ Towards fixed-parameter tractable algorithms for abstract argumentation ⋮ Augmenting tractable fragments of abstract argumentation ⋮ What Is a Reasonable Argumentation Semantics? ⋮ Weighted argument systems: basic definitions, algorithms, and complexity results ⋮ On the resolution-based family of abstract argumentation semantics and its grounded instance ⋮ Answering the “why” in answer set programming – A survey of explanation approaches ⋮ Design and results of the second international competition on computational models of argumentation ⋮ EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface ⋮ Graph-classes of argumentation frameworks with collective attacks ⋮ Audiences in argumentation frameworks ⋮ Argumentation in artificial intelligence ⋮ Computational properties of argument systems satisfying graph-theoretic constraints ⋮ Handling controversial arguments ⋮ Opposition Frameworks ⋮ Strong inconsistency ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence ⋮ The computational complexity of ideal semantics ⋮ Complexity of abstract argumentation under a claim-centric view ⋮ Alternative foundations for Reiter's default logic ⋮ Coherence in finite argument systems. ⋮ On the equivalence and range of applicability of graph-based representations of logic programs. ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey ⋮ Indepth combinatorial analysis of admissible sets for abstract argumentation ⋮ Two party immediate response disputes: Properties and efficiency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tie-breaking semantics and structural totality
• On kernels and semikernels of digraphs
• Almost all digraphs have a kernel
• On generating all maximal independent sets
• A logic for default reasoning
• General logical databases and programs: Default logic semantics and stratification
• Three-valued nonmonotonic formalisms and semantics of logic programs
• Cumulative default logic: In defense of nonmonotonic inference rules
• Stable and extension class theory for logic programs and default logics
• On the existence of kernels and \(h\)-kernels in directed graphs
• Dualities between alternative semantics for logic programming and nonmonotonic reasoning
• A graph-theoretic approach to default logic
• On kernels, defaults and even graphs
• A nondeterministic well-founded semantics
• Kernels in random graphs
• Recent problems and results about kernels in directed graphs
• Completed logic programs and their consistency
• A sufficient condition for a digraph to be kernel-perfect
• A New Algorithm for Generating All the Maximal Independent Sets
• A survey of complexity results for non-monotonic logics
• Autoepistemic logic
• On claw-freeM-oriented critical kernel-imperfect digraphs
• On computing logic programs

This page was built for publication: Graph theoretical structures in logic programs and default theories