499 search results - page 41 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
143
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
140
click to vote
CSFW
2003
IEEE
15 years 9 months ago
2003
IEEE
A policy describes the conditions under which an action is permitted or forbidden. We show that a fragment of (multi-sorted) first-order logic can be used to represent and reason...
158
click to vote
JAR
2007
15 years 4 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
139
click to vote
EACL
1993
ACL Anthology
15 years 5 months ago
1993
ACL Anthology
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...
121
click to vote
TPHOL
2005
IEEE
15 years 10 months ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...