3572 search results - page 158 / 715 » Nominal Logic Programming |
FLAIRS
1998
15 years 2 months ago
1998
In this papera newoperatorfor agent's implicit belief revisionis presented.Thisoperatoris conceptually based on the following requirement:anagent should find first anexplanat...
95
Voted
SEMWEB
2009
Springer
15 years 7 months ago
2009
Springer
Traditional object-oriented programming languages can be difficult to use when working with ontologies, leading to the creation of domain-specific languages designed specifically...
101
click to vote
EUROCOLT
1999
Springer
15 years 5 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
105
Voted
LPNMR
2004
Springer
15 years 6 months ago
2004
Springer
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
111
Voted
IAT
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...