Sciweavers

2035 search results - page 279 / 407
» On the complexity of stratified logics
Sort
View
86
Voted
JAPLL
2008
88views more  JAPLL 2008»
15 years 24 days ago
Living up to one's commitments: Agency, strategies and trust
In human social interaction, the notions of commitment and trust are strongly interrelated. A formal model for this interrelation will enable artificial agents to benefit from the...
Thomas Müller
113
Voted
JCP
2006
91views more  JCP 2006»
15 years 23 days ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
ENTCS
2007
156views more  ENTCS 2007»
15 years 23 days ago
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
Erika Ábrahám, Marc Herbstritt, Bern...
AI
2005
Springer
15 years 22 days ago
First order LUB approximations: characterization and algorithms
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
Alvaro del Val
JDS
2007
104views more  JDS 2007»
15 years 21 days ago
Operational Risk Management How an I-DSS May Help
Operational Risk management, the least covered component of Enterprise Wide Risk Management, needs intelligent tools to implement Comprehensive Emergency Management Programs. In t...
Pedro A. C. Sousa, João Paulo Pimentã...