144 search results - page 21 / 29 » On meta complexity of propositional formulas and proposition... |
171
click to vote
JAIR
2002
15 years 5 months ago
2002
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...
182
click to vote
FMICS
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
141
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...
165
click to vote
RELMICS
2000
Springer
15 years 9 months ago
2000
Springer
Abstract: The Duration Calculus is an interval logic introduced for designing realtime systems. This calculus is able to capture important real-time problems like the speci cation ...
167
click to vote
ECCC
2007
15 years 6 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...