Sciweavers

2225 search results - page 56 / 445
» Logical Structures in the Lexicon
Sort
View
ICCD
2000
IEEE
79views Hardware» more  ICCD 2000»
16 years 8 days ago
Efficient Logic Optimization Using Regularity Extraction
This paper presents a new method to extract functionally equivalent structures from logic netlists. It uses a fast functional regularity extraction algorithm based on structural e...
Thomas Kutzschebauch
DEON
2010
Springer
15 years 5 months ago
A Dyadic Operator for the Gradation of Desirability
We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal "until". By bringing significant expressiveness to the logic, it ...
Guillaume Piolle
APAL
2006
76views more  APAL 2006»
15 years 3 months ago
Non-primitive recursive decidability of products of modal logics with expanding domains
We show that--unlike products of `transitive' modal logics which are usually undecidable-their `expanding domain' relativisations can be decidable, though not in primiti...
David Gabelaia, Agi Kurucz, Frank Wolter, Michael ...
MFCS
2000
Springer
15 years 7 months ago
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey
The probability of a property on the collection of all finite relational structures is the limit as
Phokion G. Kolaitis, Moshe Y. Vardi
111
Voted
ENTCS
2008
101views more  ENTCS 2008»
15 years 3 months ago
Model Checking Quantitative Linear Time Logic
This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains.
Marco Faella, Axel Legay, Mariëlle Stoelinga