Sciweavers

150 search results - page 12 / 30
» Complexity of the Unique Extension Problem in Default Logic
Sort
View
CORR
2007
Springer
177views Education» more  CORR 2007»
14 years 9 months ago
N3Logic: A Logical Framework For the World Wide Web
The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the S...
Tim Berners-Lee, Dan Connolly, Lalana Kagal, Yosi ...
DLOG
2001
14 years 11 months ago
On Expressive Number Restrictions in Description Logics
We consider expressive Description Logics (ALCN) allowing for number restrictions on complex roles built with combinations of role constructors. In particular, we are mainly inter...
Fabio Grandi
ICFEM
2009
Springer
14 years 7 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
ICLP
1997
Springer
15 years 1 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
FOSSACS
2007
Springer
15 years 3 months ago
On the Expressiveness and Complexity of ATL
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
François Laroussinie, Nicolas Markey, Ghass...