271 search results - page 4 / 55 » A comparison between two logical formalisms for rewriting |
PPDP
2009
Springer
14 years 9 days ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
ARGMAS
2004
Springer
13 years 11 months ago
2004
Springer
This paper compares within the MAS framework two separate threads in the formal study of epistemic change: belief revision and argumentation theories. Belief revision describes how...
ENTCS
2008
13 years 5 months ago
2008
Rewrite theories and their associated Kripke structures constitute a flexible and executable framework in which a wide range of systems can be studied. We present a general notion...
ICML
2008
IEEE
14 years 6 months ago
2008
IEEE
Residual gradient (RG) was proposed as an alternative to TD(0) for policy evaluation when function approximation is used, but there exists little formal analysis comparing them ex...
SKG
2006
IEEE
13 years 11 months ago
2006
IEEE
Semantic completeness and syntax completeness are important characters of the general formal systems, two the completeness have different meaning for a formal system. This paper a...