In this paper we introduce the CSFLOC algorithm which counts full-length clauses. It is the
successor of the Optimized CCC algorithm. By studying Optimized CCC we observed that its …

Real-time logic (RTL) is useful for the verification of a safety assertion with respect to the
specification of a realtime system. Since the satisfiability problem for RTL is undecidable, the …

Both specification and verification of business processes are gaining more and more
attention in the field. Most of the existing works in the last years are dealing with important …

Embedded and real-time systems are increasingly common and complex, requiring formal
specification and verification in order to guarantee their satisfaction of desirable safety and …

Real-time logic (RTL)(F. Jahanian et al., 1986, 1987, F. Wang et al., 1994) is useful for the
verification of a safety assertion with respect to the specification of a real-time system. Since …

Finding subclasses of formulae for which the SAT problem can be solved in polynomial time
has been an important problem in computer science. We present a new hierarchy of …

We present a new planning algorithm that formulates the planning problem as a counting
satisfiability problem in which the number of available solutions guides the planner …

The problem of counting satisfiability, ie count the number of satisfying assignments for a
SAT problem, is used successfully in a number of problems. For example, it can provide …

While many attempts have been done towards creating mixed reality platforms for mobile
client devices, there have not been any significant efforts at the server/infrastructure side. We …

Finding subclasses of formulæ for which the SAT problem can be solved in polynomial time
has been an important problem in computer science. We present a new hierarchy of …