7075 search results - page 74 / 1415 » Models and heterogeneous reasoning |
SAT
2004
Springer
14 years 3 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
AGP
2003
IEEE
14 years 1 months ago
2003
IEEE
Dynamic logic programming allows the representation and the inference of evolving knowledge. Legal knowledge reasoning needs the capability to model laws that change over time and ...
ICAIL
2003
ACM
14 years 3 months ago
2003
ACM
Robust decision support systems (DSSs) for crime investigation are difficult to construct because of the almost infinite variation of plausible crime scenarios. Thus, existing ap...
TABLEAUX
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
JELIA
2004
Springer
14 years 3 months ago
2004
Springer
Practical reasoners are resource-bounded—in particular they require time to derive consequences of their knowledge. Building on the Timed Reasoning Logics (TRL) framework introdu...