507 search results - page 46 / 102 » Automating first-order relational logic |
102
click to vote
CSL
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
AMAI
2006
Springer
15 years 23 days ago
2006
Springer
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
103
Voted
CSL
2008
Springer
15 years 2 months ago
2008
Springer
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
118
Voted
DLOG
2009
14 years 10 months ago
2009
In this work we summarize our recent results on extending Description Logics for reasoning about prototypical properties and inheritance with exceptions. First, we focus our attent...
95
Voted
LICS
1990
IEEE
15 years 4 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...