Sciweavers

387 search results - page 40 / 78
» Hyperequivalence of Logic Programs with Respect to Supported...
Sort
View
ENTCS
2007
105views more  ENTCS 2007»
13 years 9 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
CSL
2006
Springer
14 years 19 days ago
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
Lukasz Kaiser
ILP
2007
Springer
14 years 3 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...
IEAAIE
2004
Springer
14 years 2 months ago
Machine Learning Approaches for Inducing Student Models
The main issue in e-learning is student modelling, i.e. the analysis of a student’s behaviour and prediction of his/her future behaviour and learning performance. Indeed, it is d...
Oriana Licchelli, Teresa Maria Altomare Basile, Ni...
TACAS
2005
Springer
124views Algorithms» more  TACAS 2005»
14 years 2 months ago
Dynamic Symmetry Reduction
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
E. Allen Emerson, Thomas Wahl