850 search results - page 96 / 170 » A Logic Programming Language Based on Binding Algebras |
125
click to vote
TPHOL
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
163
click to vote
DIMACS
1996
15 years 2 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
100
click to vote
RULEML
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we argue that a realistic architecture for the Semantic Web must be based on multiple independent, but interoperable, stacks of languages. In particular, we argue tha...
182
click to vote
ICTL
1994
15 years 5 months ago
1994
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
120
click to vote
TCS
2011
14 years 8 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...