Sciweavers

1410 search results - page 175 / 282
» Proving theorems by reuse
Sort
View
ATAL
2007
Springer
15 years 10 months ago
A unified and general framework for argumentation-based negotiation
This paper proposes a unified and general framework for argumentation-based negotiation, in which the role of argumentation is formally analyzed. The framework makes it possible t...
Leila Amgoud, Yannis Dimopoulos, Pavlos Moraitis
CSFW
2009
IEEE
15 years 10 months ago
Specification and Analysis of Dynamic Authorisation Policies
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
Moritz Y. Becker
ACL2
2006
ACM
15 years 9 months ago
Quantification in tail-recursive function definitions
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
Sandip Ray
ASIAN
2006
Springer
91views Algorithms» more  ASIAN 2006»
15 years 9 months ago
A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
Zhaohui Luo
ATAL
2006
Springer
15 years 9 months ago
Symbolic negotiation revisited
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
Peep Küngas, Mihhail Matskin