191 search results - page 25 / 39 » Temporal Extensions to Defeasible Logic |
164
Voted
POPL
2006
ACM
15 years 10 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
CLIMA
2007
14 years 11 months ago
2007
We propose a new version of ATLP (“ATL with plausibility”), a logic for reasoning about the outcome of rational play in game-like scenarios. Unlike in [8], where two different ...
ASP
2001
Springer
15 years 1 months ago
2001
Springer
In this paper we implement planning using answer set programming. We consider the action language A and its extensions. We show that when the domain is described using richer feat...
110
click to vote
TACAS
2012
Springer
13 years 5 months ago
2012
Springer
The number of malware is growing extraordinarily fast. Therefore, it is important to have efficient malware detectors. Malware writers try to obfuscate their code by different tec...