507 search results - page 69 / 102 » Automating first-order relational logic |
109
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
131
click to vote
SARA
2007
Springer
15 years 10 months ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
163
click to vote
LPNMR
1995
Springer
15 years 7 months ago
1995
Springer
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...
130
click to vote
DLOG
2003
15 years 5 months ago
2003
In this chapter, we are concerned with the relationship between Description Logics and other formalisms, regardless of whether they were designed for knowledge representation issu...
175
click to vote
PODS
1994
ACM
15 years 8 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...