2573 search results - page 230 / 515 » Combinations of Modal Logics |
191
Voted
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
131
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We present a timing optimization algorithm based on the concept of gate duplication on the technologydecomposed network. We first examine the relationship between gate duplication...
171
Voted
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper describes a novel design methodology to implement a secure DPA resistant crypto processor. The methodology is suitable for integration in a common automated standard ce...
201
click to vote
TYPES
2000
Springer
15 years 10 months ago
2000
Springer
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
167
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
We present a resolution-based decision procedure for the description logic SHOIQ--the logic underlying the Semantic Web ontology language OWL-DL. Our procedure is goal-oriented, an...