Graph theoretical structures in logic programs and default theories
From MaRDI portal
Publication:672050
DOI10.1016/S0304-3975(96)80707-9zbMATH Open0874.68190MaRDI QIDQ672050FDOQ672050
Yannis Dimopoulos, Alberto Torres
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Logic programming (68N17) Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- A New Algorithm for Generating All the Maximal Independent Sets
- Recent problems and results about kernels in directed graphs
- A sufficient condition for a digraph to be kernel-perfect
- On kernels and semikernels of digraphs
- Autoepistemic logic
- On generating all maximal independent sets
- A logic for default reasoning
- On kernels, defaults and even graphs
- A graph-theoretic approach to default logic
- A survey of complexity results for non-monotonic logics
- 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
- A nondeterministic well-founded semantics
- Kernels in random graphs
- Completed logic programs and their consistency
- On claw-freeM-oriented critical kernel-imperfect digraphs
- On computing logic programs
- Tie-breaking semantics and structural totality
- Almost all digraphs have a kernel
Cited In (58)
- Title not available (Why is that?)
- What Is a Reasonable Argumentation Semantics?
- Taking into account ``who said what in abstract argumentation: complexity results
- Lattice point of view for argumentation framework
- The complexity landscape of claim-augmented argumentation frameworks
- Augmenting tractable fragments of abstract argumentation
- On the equivalence and range of applicability of graph-based representations of logic programs.
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Indepth combinatorial analysis of admissible sets for abstract argumentation
- Semantics for existential graphs
- Design and results of the second international competition on computational models of argumentation
- A term-graph clausal logic: completeness and incompleteness results ★
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Finding kernels or solving SAT
- Kernels in digraphs that are not kernel perfect
- Argumentation in artificial intelligence
- The computational complexity of ideal semantics
- A nondeterministic well-founded semantics
- Answering the “why” in answer set programming – A survey of explanation approaches
- Acceptance in incomplete argumentation frameworks
- Alternative foundations for Reiter's default logic
- Resource graphs and countermodels in resource logics
- Preferred extensions as stable models
- Graph logics with rational relations
- Complexity of nonemptiness in control argumentation frameworks
- Graphical models of separation logic
- Weighted argument systems: basic definitions, algorithms, and complexity results
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
- Complexity-sensitive decision procedures for abstract argumentation
- Graph-classes of argumentation frameworks with collective attacks
- On the resolution-based family of abstract argumentation semantics and its grounded instance
- Backdoors to Satisfaction
- Computational properties of argument systems satisfying graph-theoretic constraints
- Propositional discourse logic
- Opposition Frameworks
- Labellings for assumption-based and abstract argumentation
- Characteristics of multiple viewpoints in abstract argumentation
- Improved answer-set programming encodings for abstract argumentation
- On the Expressive Power of Graph Logic
- Deduction graphs: an algorithm and applications
- On the preferred extensions of argumentation frameworks: bijections with naive sets
- Layerings of logic programs -- layer decomposable semantics and incremental model computation
- EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface
- Complexity of abstract argumentation under a claim-centric view
- Two party immediate response disputes: Properties and efficiency
- Handling controversial arguments
- Audiences in argumentation frameworks
- An extension-based approach to belief revision in abstract argumentation
- Title not available (Why is that?)
- Coherence in finite argument systems.
- Verification in incomplete argumentation frameworks
- Title not available (Why is that?)
- Graph Logics with Rational Relations and the Generalized Intersection Problem
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Incorrectness logic for graph programs
- Strong inconsistency
- Existential Graphs as a Basis for Structural Reasoning
Recommendations
- On a graph approach to modal logics 👍 👎
- A Graph-theoretic Account of Logics 👍 👎
- On the Expressive Power of Graph Logic 👍 👎
- Graph properties for normal logic programs 👍 👎
- Existential Graphs as a Basis for Structural Reasoning 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Graph theoretical structures in logic programs and default theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672050)
