725 search results - page 77 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
204
click to vote
LPAR
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
205
click to vote
ESOP
2000
Springer
15 years 9 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
171
click to vote
EEE
2005
IEEE
15 years 11 months ago
2005
IEEE
As the IT industry is becoming more and more interested in service oriented business models and upcoming technologies like Web Services or Grid Computing, the need for automated c...
191
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
186
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...