Sciweavers

32 search results - page 6 / 7
» Taming the Complexity of Inductive Logic Programming
Sort
View
ILP
2007
Springer
13 years 12 months ago
Building Relational World Models for Reinforcement Learning
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
Trevor Walker, Lisa Torrey, Jude W. Shavlik, Richa...
KBSE
2000
IEEE
13 years 9 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
JAIR
2008
157views more  JAIR 2008»
13 years 5 months ago
Qualitative System Identification from Imperfect Data
Experience in the physical sciences suggests that the only realistic means of understanding complex systems is through the use of mathematical models. Typically, this has come to ...
George Macleod Coghill, Ashwin Srinivasan, Ross D....
VMCAI
2004
Springer
13 years 11 months ago
Construction of a Semantic Model for a Typed Assembly Language
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao...
JOBIM
2000
13 years 9 months ago
InterDB, a Prediction-Oriented Protein Interaction Database for C. elegans
Protein-protein interactions are critical to many biological processes, extending from the formation of cellular macromolecular structures and enzymatic complexes to the regulation...
Nicolas Thierry-Mieg, Laurent Trilling