Sciweavers

1071 search results - page 151 / 215
» Modal Logics, Description Logics and Arithmetic Reasoning
Sort
View
IANDC
2010
95views more  IANDC 2010»
14 years 7 months ago
Structured anaphora to quantifier domains
The paper proposes a novel analysis of quantificational subordination, e.g. Harvey courts a woman at every convention. {She is very pretty. vs. She always comes to the banquet with...
Adrian Brasoveanu
CADE
2008
Springer
15 years 10 months ago
Multi-completion with Termination Tools (System Description)
Abstract. In this paper we describe a new tool for performing KnuthBendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for ...
Haruhiko Sato, Sarah Winkler, Masahito Kurihara, A...
WWW
2007
ACM
15 years 10 months ago
Analyzing web access control policies
XACML has emerged as a popular access control language on the Web, but because of its rich expressiveness, it has proved difficult to analyze in an automated fashion. In this pape...
Vladimir Kolovski, James A. Hendler, Bijan Parsia
DLOG
2008
15 years 3 days ago
Checking DL-Lite Modularity with QBF Solvers
We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...
Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter...
LICS
1994
IEEE
15 years 1 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka