2067 search results - page 8 / 414 » Logics of propositional control |
EUSFLAT
2009
14 years 7 months ago
2009
FROCOS
2007
Springer
15 years 3 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
SBIA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. The aim of this paper is to study a family of logics that approximates classical inference, in which every step in the approximation can be decided in polynomial time. Fo...
108
click to vote
ICDT
2009
ACM
15 years 4 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...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given pro...