2062 search results - page 51 / 413 » Derivatives of Logical Formulas |
93
Voted
DBPL
2001
Springer
15 years 3 months ago
2001
Springer
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formul...
119
Voted
ICDT
2009
ACM
15 years 5 months ago
2009
ACM
A formal semantics of uncertain databases typically takes an algebraic approach by mapping an uncertain database to a set of relational databases, or possible worlds. We present a...
65
Voted
ENTCS
2010
14 years 11 months ago
2010
We report on the implementation and experimental analysis of an incremental multi-pass tableau-based procedure `a la Wolper for testing satisfiability in the linear time temporal ...
104
Voted
LATA
2009
Springer
15 years 5 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
82
Voted
SAT
2005
Springer
15 years 4 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...