Sciweavers

634 search results - page 36 / 127
» Completion Procedures as Semidecision Procedures
Sort
View
ICDT
2003
ACM
127views Database» more  ICDT 2003»
15 years 2 months ago
On Reasoning about Structural Equality in XML: A Description Logic Approach
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
David Toman, Grant E. Weddell
WISE
2002
Springer
15 years 2 months ago
Discovering Associations in XML Data
—Knowledge inference from semi-structured data can utilize frequent sub structures, in addition to frequency of data items. In fact, the working assumption of the present study i...
Amnon Meisels, Michael Orlov, Tal Maor
TABLEAUX
2009
Springer
15 years 2 months ago
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
Luis Pinto, Tarmo Uustalu
IPPS
2000
IEEE
15 years 2 months ago
Fast Measurement of LogP Parameters for Message Passing Platforms
Abstract. Performance modeling is important for implementing efficient parallel applications and runtime systems. The LogP model captures the relevant aspects of message passing i...
Thilo Kielmann, Henri E. Bal, Kees Verstoep
TABLEAUX
1995
Springer
15 years 1 months ago
On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof...
Stephan Schmitt, Christoph Kreitz