Sciweavers

2022 search results - page 282 / 405
» Complexity of Non-Monotonic Logics
Sort
View
CORR
2006
Springer
86views Education» more  CORR 2006»
15 years 6 months ago
Improving Precision of Type Analysis Using Non-Discriminative Union
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type...
Lunjin Lu
IJNSEC
2008
75views more  IJNSEC 2008»
15 years 6 months ago
A Key Management Scheme for Hierarchical Access Control in Group Communication
In group communication, users often have different access rights to multiple data streams. Based on the access relation of users and data streams, users can form partially ordered...
Qiong Zhang, Yuke Wang, Jason P. Jue
JAPLL
2008
88views more  JAPLL 2008»
15 years 6 months 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
JCP
2006
91views more  JCP 2006»
15 years 6 months 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 6 months 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...