746 search results - page 11 / 150 » Connectionist Propositional Logic |
124
Voted
APAL
2005
15 years 2 months ago
2005
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
142
Voted
CADE
2012
Springer
13 years 5 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
124
Voted
JSYML
2002
15 years 2 months ago
2002
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
CSL
2010
Springer
15 years 3 months ago
2010
Springer
Modal dependence logic was introduced very recently by V
126
click to vote
APAL
2006
15 years 2 months ago
2006
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...