Sciweavers

2299 search results - page 132 / 460
» Logical Data Expiration
Sort
View
LICS
2002
IEEE
15 years 8 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 8 months ago
Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions
Abstract. In using the logic of equality with unininterpreted functions to verify hardware systems, specific characteristics of the formula describing the correctness condition ca...
Randal E. Bryant, Steven M. German, Miroslav N. Ve...
LPAR
1999
Springer
15 years 8 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies
LMCS
2007
132views more  LMCS 2007»
15 years 3 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
CVPR
2007
IEEE
16 years 5 months ago
Combining Static Classifiers and Class Syntax Models for Logical Entity Recognition in Scanned Historical Documents
Class syntax can be used to 1) model temporal or locational evolvement of class labels of feature observation sequences, 2) correct classification errors of static classifiers if ...
Song Mao, Praveer Mansukhani, George R. Thoma