Sciweavers

271 search results - page 4 / 55
» A comparison between two logical formalisms for rewriting
Sort
View
PPDP
2009
Springer
15 years 7 months ago
Set functions for functional logic programming
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...
Sergio Antoy, Michael Hanus
ARGMAS
2004
Springer
15 years 5 months ago
Revising Beliefs Through Arguments: Bridging the Gap Between Argumentation and Belief Revision in MAS
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...
Fabio Paglieri, Cristiano Castelfranchi
77
Voted
ENTCS
2008
128views more  ENTCS 2008»
15 years 15 days ago
Algebraic Stuttering Simulations
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...
Narciso Martí-Oliet, José Meseguer, ...
ICML
2008
IEEE
16 years 1 months ago
A worst-case comparison between temporal difference and residual gradient with linear function approximation
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...
Lihong Li
104
Voted
SKG
2006
IEEE
15 years 6 months ago
Relation between Semantic Completeness and Syntax Completeness on General Formal Systems
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...
Zhenghua Pan