2573 search results - page 179 / 515 » Combinations of Modal Logics |
156
Voted
DLOG
2006
15 years 6 months ago
2006
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...
187
click to vote
PLPV
2012
ACM
14 years 8 days ago
2012
ACM
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
154
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
140
click to vote
LPNMR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Belief Logic Programming (BLP) is a novel form of quantitative logic programming in the presence of uncertain and inconsistent information, which was designed to be able ...
139
click to vote
DAC
2007
ACM
16 years 5 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...