1545 search results - page 140 / 309 » Defeasible Description Logics |
100
click to vote
DLOG
2009
14 years 10 months ago
2009
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
83
Voted
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...
120
Voted
CORR
1999
Springer
15 years 14 days ago
1999
Springer
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
98
Voted
KES
1999
Springer
15 years 5 months ago
1999
Springer
A shape specification system based on fuzzy logic is proposed, which aims to facilitate designers in conceptual design stage by allowing them to specify and work with rough models...