Sciweavers

88 search results - page 14 / 18
» A Completeness Result for Reasoning with Incomplete First-Or...
Sort
View
FCSC
2011
413views VLSI» more  FCSC 2011»
12 years 10 months ago
Type-2 fuzzy description logic
Description logics (DLs) are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and ...
Ruixuan Li, Kunmei Wen, Xiwu Gu, Yuhua Li, Xiaolin...
LOPSTR
2001
Springer
13 years 11 months ago
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Giorgio Delzanno, Sandro Etalle
BMCBI
2010
119views more  BMCBI 2010»
13 years 6 months ago
Functional classification of proteins based on projection of amino acid sequences: application for prediction of protein kinase
Background: The knowledge about proteins with specific interaction capacity to the protein partners is very important for the modeling of cell signaling networks. However, the exp...
Boris Sobolev, Dmitry Filimonov, Alexey Lagunin, A...
TIME
2009
IEEE
14 years 1 months ago
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
Luke Hunsberger
AI
2008
Springer
13 years 6 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini