746 search results - page 76 / 150 » Connectionist Propositional Logic |
96
Voted
CAV
2012
Springer
13 years 21 days ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
104
Voted
FLAIRS
2008
15 years 18 days ago
2008
Combining probability and first-order logic has been the subject of intensive research during the last ten years. The most well-known formalisms combining probability and some sub...
103
Voted
CORR
1998
Springer
14 years 10 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
66
Voted
WOLLIC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...
71
Voted
TABLEAUX
2005
Springer
15 years 3 months ago
2005
Springer
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are simi...