Sciweavers

393 search results - page 76 / 79
» Logic Programs with Classical Negation
Sort
View
OOPSLA
2009
Springer
14 years 1 months ago
Self type constructors
Bruce and Foster proposed the language LOOJ, an extension of Java with the notion of MyType, which represents the type of a self reference and changes its meaning along with inher...
Chieri Saito, Atsushi Igarashi
AIMSA
2008
Springer
14 years 1 months ago
Prototypes Based Relational Learning
Relational instance-based learning (RIBL) algorithms offer high prediction capabilities. However, they do not scale up well, specially in domains where there is a time bound for c...
Rocío García-Durán, Fernando ...
ILP
2007
Springer
14 years 1 months ago
Learning to Assign Degrees of Belief in Relational Domains
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
Frédéric Koriche
FM
2006
Springer
127views Formal Methods» more  FM 2006»
13 years 11 months ago
Using Domain-Independent Problems for Introducing Formal Methods
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
Raymond T. Boute
CORR
2007
Springer
77views Education» more  CORR 2007»
13 years 7 months ago
On the interaction between sharing and linearity
nalysis of logic programs, abstract domains for detecting sharing and linearity ion are widely used. Devising abstract unification algorithms for such domains has proved to be ra...
Gianluca Amato, Francesca Scozzari