1435 search results - page 164 / 287 » E-connections of Description Logics |
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
DEXAW
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper we explore embeddings of the various kinds of RDF entailment in F-Logic. We show that the embeddings of simple, RDF, and RDFS entailment, as well as a large fragment...
155
click to vote
CL
2000
Springer
15 years 5 months ago
2000
Springer
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
206
click to vote
POPL
1999
ACM
15 years 5 months ago
1999
ACM
hought of as abstract interpretation for the heap How we talk about the heap Program var X points to U that has an N field pointing to V We use first order predicate logic ¡...
120
click to vote
BIRTHDAY
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...