778 search results - page 60 / 156 » Expressiveness and complexity of graph logic |
102
click to vote
SAS
2010
Springer
14 years 11 months ago
2010
Springer
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
87
Voted
IAT
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
118
Voted
INFORMS
1998
15 years 6 days ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
141
click to vote
AI
2011
Springer
14 years 7 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
135
Voted
IJCAI
2007
15 years 2 months ago
2007
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive quer...