Sciweavers

34 search results - page 5 / 7
» Expressivity of Coalgebraic Modal Logic: The Limits and Beyo...
Sort
View
78
Voted
ITA
2007
14 years 9 months ago
Three notes on the complexity of model checking fixpoint logic with chop
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
Martin Lange
LICS
2007
IEEE
15 years 3 months ago
A Complete Axiomatization of Knowledge and Cryptography
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
Mika Cohen, Mads Dam
DLOG
2010
14 years 7 months ago
Generating Referring Expressions with OWL2
The task of generating referring expressions, an important subtask of Natural Language Generation is to generate phrases that uniquely identify domain entities. Until recently, man...
Yuan Ren, Kees van Deemter, Jeff Z. Pan
88
Voted
WOLLIC
2010
Springer
15 years 2 months ago
On Anaphora and the Binding Principles in Categorial Grammar
In type logical categorial grammar the analysis of an expression is a resource-conscious proof. Anaphora represents a particular challenge to this approach in that the antecedent ...
Glyn Morrill, Oriol Valentín
VMCAI
2010
Springer
15 years 6 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...