746 search results - page 62 / 150 » Connectionist Propositional Logic |
156
Voted
DEON
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We show that a recently developed theory of positive permission based on the notion of derogation is hampered by a triviality result that indicates a problem with the und...
148
click to vote
AMAI
2006
Springer
15 years 3 months ago
2006
Springer
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
127
click to vote
ENTCS
2007
15 years 3 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
111
Voted
CADE
2003
Springer
16 years 3 months ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
121
Voted
CADE
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...