616 search results - page 73 / 124 » Bounded Model Checking with Description Logic Reasoning |
ATAL
2004
Springer
14 years 2 months ago
2004
Springer
We introduce a Game Logic with Preferences (GLP), which makes it possible to reason about how information or assumptions about the preferences of other players can be used by agen...
DAC
2005
ACM
13 years 10 months ago
2005
ACM
We propose a normalization technique for verifying arithmetic circuits in a bounded model checking environment. Our technique operates on the arithmetic bit level (ABL) descriptio...
AIL
2007
13 years 9 months ago
2007
In order to improve the management of copyright in the Internet, known as Digital Rights Management, there is the need for a shared language for copyright representation. Current a...
TOPNOC
2008
13 years 8 months ago
2008
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
LICS
2007
IEEE
14 years 3 months ago
2007
IEEE
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...