Sciweavers

1268 search results - page 21 / 254
» One Logic to Use Them All
Sort
View
MATES
2004
Springer
14 years 3 months ago
Paraconsistent Assertions
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an exp...
Jørgen Villadsen
FOSSACS
2007
Springer
14 years 1 months ago
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...
IAT
2008
IEEE
14 years 4 months ago
Obligations with Deadlines and Maintained Interdictions in Privacy Regulation Frameworks
We aim at providing artificial agents with logical tools to reason specifically on privacy-related regulations, in order to comply with them. In order to express these regulatio...
Guillaume Piolle, Yves Demazeau
CASES
2001
ACM
14 years 1 months ago
Pattern matching in reconfigurable logic for packet classification
We describe a digital circuit synthesis algorithm specialized for the domain of pattern matching circuits implemented in reconfigurable logic. We propose to use this algorithm as ...
Adam Johnson, Kenneth Mackenzie
ICDT
2007
ACM
97views Database» more  ICDT 2007»
14 years 4 months ago
Combining Temporal Logics for Querying XML Documents
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
Marcelo Arenas, Pablo Barceló, Leonid Libki...