2722 search results - page 319 / 545 » Automating Language Evolution |
142
Voted
SEMWEB
2004
Springer
15 years 9 months ago
2004
Springer
OWL DL corresponds to a Description Logic (DL) that is a fragment of classical first-order predicate logic (FOL). Therefore, the standard methods of automated reasoning for full F...
132
click to vote
ICLP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
132
click to vote
FLOPS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
137
click to vote
TABLEAUX
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. Set theory is the common language of mathematics. Therefore, set theory plays an important r^ole in many important applications of automated deduction. In this paper, we ...
121
click to vote
WCRE
2000
IEEE
15 years 7 months ago
2000
IEEE
The FermaT transformation system, based on research carried out over the last sixteen years at Durham University, De Montfort University and Software Migrations Ltd., is an indust...