Sciweavers

1032 search results - page 57 / 207
» Extended Computation Tree Logic
Sort
View
JLP
2007
114views more  JLP 2007»
14 years 10 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
ACNS
2003
Springer
156views Cryptology» more  ACNS 2003»
15 years 1 months ago
An Efficient Tree-Based Group Key Agreement Using Bilinear Map
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challeng...
Sangwon Lee, Yongdae Kim, Kwangjo Kim, DaeHyun Ryu
COMPUTER
1998
131views more  COMPUTER 1998»
14 years 9 months ago
Windows NT Clustering Service
ER ABSTRACTIONS ter service uses several abstractions— including resource, resource dependencies, and resource groups—to simplify both the cluster service itself and user-visib...
Rod Gamache, Rob Short, Mike Massa
CORR
2010
Springer
68views Education» more  CORR 2010»
14 years 10 months ago
An Optimization for Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Cristina Feier, Stijn Heymans
EPIA
2005
Springer
15 years 3 months ago
Operational Semantics for DyLPs
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly ...
Federico Banti, José Júlio Alferes, ...