Sciweavers

565 search results - page 24 / 113
» A logic for authorization provenance
Sort
View
AAAI
1998
13 years 9 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington
KSEM
2010
Springer
13 years 6 months ago
Discovery of Relation Axioms from the Web
Given the proven usefulness of ontologies in many areas, the representation of logical axioms associated to ontological concepts and relations has become an important task in order...
Luis Del Vasto Terrientes, Antonio Moreno, David S...
IWANN
2009
Springer
14 years 2 months ago
Fuzzy Logic, Soft Computing, and Applications
We survey on the theoretical and practical developments of the theory of fuzzy logic and soft computing. Specifically, we briefly review the history and main milestones of fuzzy ...
Inma P. Cabrera, Pablo Cordero, Manuel Ojeda-Acieg...
TASE
2008
IEEE
14 years 1 months ago
Verifying BPEL-Like Programs with Hoare Logic
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechan...
Chenguang Luo, Shengchao Qin, Zongyan Qiu
TACAS
2001
Springer
125views Algorithms» more  TACAS 2001»
13 years 12 months ago
Coverage Metrics for Temporal Logic Model Checking
In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complet...
Hana Chockler, Orna Kupferman, Moshe Y. Vardi