503 search results - page 42 / 101 » Interpolative Boolean Logic |
100
Voted
FCS
2007
15 years 4 months ago
2007
Instances of the futile questioning problem abound in applications, especially, in the area of artificial intelligence. The problem can be represented by a particular quantified ...
106
Voted
APAL
2005
15 years 2 months ago
2005
We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski (...
111
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...
115
Voted
TIME
1994
IEEE
15 years 6 months ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...