Sciweavers

1283 search results - page 167 / 257
» A Survey on Temporal Logics
Sort
View
LMCS
2007
132views more  LMCS 2007»
15 years 6 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 8 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
SIGIR
1996
ACM
15 years 10 months ago
Retrieval of Complex Objects Using a Four-Valued Logic
The aggregated structure of documents plays a key role in full-text, multimedia, and network Information Retrieval (IR). Considering aggregation provides new querying facilities a...
Thomas Rölleke, Norbert Fuhr
ATVA
2007
Springer
152views Hardware» more  ATVA 2007»
16 years 17 days ago
Bounded Synthesis
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
Sven Schewe, Bernd Finkbeiner
ICLP
2003
Springer
15 years 11 months ago
Concurrency, Time, and Constraints
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
Frank D. Valencia