2035 search results - page 63 / 407 » On the complexity of stratified logics |
133
click to vote
LICS
2009
IEEE
16 years 24 days ago
2009
IEEE
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
192
click to vote
ASP
2005
Springer
15 years 11 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
141
click to vote
CSL
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...
136
click to vote
ISLPED
1998
ACM
15 years 10 months ago
1998
ACM
Adiabatic logic promises extremely low power consumption for those applications where slower clock rates are acceptable. However, there have been very few adiabatic memory designs...
160
click to vote
AAAI
2010
15 years 7 months ago
2010
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...