2432 search results - page 105 / 487 » Cryptographic logical relations |
87
Voted
CSL
2010
Springer
15 years 21 days ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
127
Voted
TCS
1998
15 years 7 days ago
1998
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
102
click to vote
KR
1998
Springer
15 years 4 months ago
1998
Springer
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description langua...
AI
2006
Springer
15 years 20 days ago
2006
Springer
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
111
Voted
AIM
2005
15 years 15 days ago
2005
This paper surveys previous work on combining planning techniques with expressive representations of knowledge in description logics to reason about tasks, plans, and goals. Descr...