162 search results - page 2 / 33 » A note on an extension of PDL |
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—Despite the importance of traffic classification in modern networks, the number of languages tailored to this task is extremely limited. These languages can be valuable, because...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
CAEPIA
2009
Springer
13 years 6 months ago
2009
Springer
The syntax, semantics and an axiom system for an extension of Propositional Dynamic Logic (PDL) for order of magnitude qualitative reasoning which formalizes the concepts of close...
AAAI
1994
13 years 6 months ago
1994
In this paper we argue that for realistic applications involving default reasoning it is necessary to reason about the priorities of defaults. Existing approaches require the know...
IJCNN
2008
IEEE
13 years 11 months ago
2008
IEEE
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...