Sciweavers

6167 search results - page 892 / 1234
» Can Refinement be Automated
Sort
View
155
Voted
LPNMR
2001
Springer
15 years 9 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
EH
1999
IEEE
214views Hardware» more  EH 1999»
15 years 9 months ago
Coevolutionary Robotics
We address the fundamental issue of fully automated design (FAD) and construction of inexpensive robots and their controllers. Rather than seek an intelligent general purpose robo...
Jordan B. Pollack, Hod Lipson, Pablo Funes, Sevan ...
GIS
1999
ACM
15 years 9 months ago
Animated Cartography for Urban Soundscape Information
In urban areas, city noises represent today a great problem. They are real nuisances for city-dwellers. Noises are caused by traffic, road works, factories, and also by people. So...
Myoung-Ah Kang, Sylvie Servigne
DEXAW
1998
IEEE
92views Database» more  DEXAW 1998»
15 years 9 months ago
Self-Configuring Components for Client-/Server-Applications
A mechanistic view of software component assembly implies exact matching and fitting of the particular components. We argue that components for large-scale software construction s...
Wolfgang Pree, Egbert Althammer, Hermann Sikora
LPAR
1999
Springer
15 years 9 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies