Sciweavers

95 search results - page 13 / 19
» Truth in generic cuts
Sort
View
CADE
2009
Springer
14 years 8 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning
ACOM
2006
Springer
14 years 1 months ago
Adaptiveness in Agent Communication: Application and Adaptation of Conversation Patterns
Communication in multi-agent systems (MASs) is usually governed by agent communication languages (ACLs) and communication protocols carrying a clear cut semantics. With an increasi...
Felix A. Fischer, Michael Rovatsos, Gerhard Wei&sz...
LICS
2002
IEEE
14 years 9 days ago
Polarized Games
We study the comparison of dynamic semantics (games, dealing with interactions) with static semantics (dealing with results of interactions), in the spirit of Timeless Games [2]. ...
Olivier Laurent
IJCAI
2007
13 years 8 months ago
Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs
Hypertree decomposition has been shown to be the most general CSP decomposition method. However, so far the exact methods are not able to find optimal hypertree decompositions of...
Sathiamoorthy Subbarayan, Henrik Reif Andersen
JISBD
2003
13 years 8 months ago
Advanced Separation of Concerns for Requirements Engineering
Separation of concerns is a fundamental software engineering principle that proposes the encapsulation of each matter of interest in a separate module. Software engineering develop...
Isabel Sofia Brito, Ana M. D. Moreira