499 search results - page 18 / 100 » LTL satisfiability checking |
88
Voted
CADE
2007
Springer
15 years 9 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
74
Voted
DLOG
2010
14 years 7 months ago
2010
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
ICFEM
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
Procedures for Boolean satis ability most commonly work with Conjunctive Normal Form. Powerful SAT techniques based on implications and con icts can be retained when the usual CNF...
105
click to vote
SAC
2009
ACM
15 years 2 months ago
2009
ACM
The Semantic Web and its technologies become increasingly important. As more and more Semantic Web applications are being used, developing more stable Semantic Web applications be...