Sciweavers

38 search results - page 1 / 8
» Sound and Complete Inference Rules for SE-Consequence
Sort
View
JAIR
2008
104views more  JAIR 2008»
13 years 4 months ago
Sound and Complete Inference Rules for SE-Consequence
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
Ka-Shu Wong
VL
2000
IEEE
115views Visual Languages» more  VL 2000»
13 years 9 months ago
SD2: A Sound and Complete Diagrammatic Reasoning System
SD2 is a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They augment the systems of Venn-Peirce ...
John Howse, Fernando Molina, John Taylor
TABLEAUX
2009
Springer
13 years 11 months ago
Automated Synthesis of Tableau Calculi
This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau i...
Renate A. Schmidt, Dmitry Tishkovsky
DEXAW
2006
IEEE
111views Database» more  DEXAW 2006»
13 years 10 months ago
A Strongly Minimal Axiomatisation of Multivalued Dependencies in Incomplete Database Relations
We study inference rules for multivalued dependencies in relational databases with null values (NMVDs). The definition of NMVDs is dependent on the underlying relation schema and ...
Sebastian Link
ICDT
2007
ACM
105views Database» more  ICDT 2007»
13 years 8 months ago
Unlocking Keys for XML Trees
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
Sven Hartmann, Sebastian Link