Annotation theories over finite graphs

DOI10.1007/s11225-009-9220-3zbMath1185.03057OpenAlexW2077512555MaRDI QIDQ2269516

Andrzej Szałas, Dov M. Gabbay

Publication date: 17 March 2010

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: http://orbilu.uni.lu/handle/10993/15878

zbMATH Keywords

labeled graphsargumentation theorysecond-order quantifier eliminationannotationssemantics of logic programs

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (3)

Introducing Equational Semantics for Argumentation Networks ⋮ Semantics for higher level attacks in extended argumentation frames. I: Overview ⋮ Fibring argumentation frames

Cites Work

• On the satisfiability of circumscription
• Circumscription - a form of non-monotonic reasoning
• Computing circumscription revisited: A reduction algorithm
• Untersuchungen über das Eliminationsproblem der mathematischen Logik
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Tractable reasoning in artificial intelligence
• Syntactic codes and grammar refinement
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• A logical account of formal argumentation
• Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals
• Knowledge representation techniques. A rough set approach.
• Some computational aspects of circumscription
• On the Correspondence Between Modal and Classical Logic: an Automated Approach
• Knowledge compilation and theory approximation
• Temporal Logics with Reference Pointers and Computation Tree Logics
• The complexity of satisfiability problems
• Minimal predicates, fixed-points, and definability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Annotation theories over finite graphs