2022 search results - page 71 / 405 » Complexity of Non-Monotonic Logics |
92
Voted
CSL
2001
Springer
15 years 5 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 ...
78
Voted
ISLPED
1998
ACM
15 years 4 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...
100
click to vote
AAAI
2010
15 years 2 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 ...
187
click to vote
GIS
2004
ACM
16 years 1 months ago
2004
ACM
Motivated by the increasing need to handle complex multidimensional data in location-based data warehouses, this paper proposes a powerful data model that is able to capture the c...
107
click to vote
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...