1941 search results - page 162 / 389 » Reasoning about Computations Using Two-Levels of Logic |
137
Voted
CSL
2010
Springer
15 years 4 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
155
Voted
ICLP
1995
Springer
15 years 7 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
133
Voted
CADE
2002
Springer
16 years 3 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
135
Voted
ICLP
1995
Springer
15 years 7 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
161
Voted
DLOG
2010
15 years 1 months ago
2010
Abstract. Recently, the use of the MapReduce framework for distributed RDF Schema reasoning has shown that it is possible to compute the deductive closure of sets of over a billion...