2573 search results - page 273 / 515 » Combinations of Modal Logics |
168
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
145
click to vote
DAC
1999
ACM
15 years 11 months ago
1999
ACM
This paper describes a two-state methodology for register transfer level (RTL) logic simulation in which the use of the Xstate is completely eliminated inside ASIC designs. Exampl...
203
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
191
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
Ario is a solver for systems of linear integer arithmetic logic. Such systems are commonly used in design verification applications and are classified under Satisfiability Modulo T...
211
click to vote
IJCAI
2007
15 years 8 months ago
2007
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive quer...