2022 search results - page 70 / 405 » Complexity of Non-Monotonic Logics |
172
click to vote
JOLLI
2006
15 years 6 months ago
2006
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
146
Voted
DAC
2005
ACM
16 years 7 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
188
click to vote
JAR
2007
15 years 6 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
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
Voted
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 ...