450 search results - page 28 / 90 » Satisfiability with Exponential Families |
IJCAI
2003
15 years 1 months ago
2003
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...
106
click to vote
ENTCS
2006
14 years 12 months ago
2006
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
106
click to vote
IANDC
2008
14 years 12 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
This paper considers interval time-varying delay systems with delayed estimation of the delay. This case is often encountered in the Networked Control Systems (NCS) field. Based on...