10568 search results - page 1623 / 2114 » Computer Intelligence and Formalization |
201
click to vote
KGC
1993
Springer
15 years 11 months ago
1993
Springer
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
231
click to vote
SSD
1993
Springer
15 years 11 months ago
1993
Springer
: Spatial data types or algebras for database systems should (i) be fully general (which means, closed under set operations, hence e.g. a region value can be a set of polygons with...
162
Voted
SIGMOD
1989
ACM
15 years 11 months ago
1989
ACM
The HiPAC project is investigating active, time-constrained databasemanagment. An active DBMS is one which automatically executes specified actions when speciifed conditions arise...
200
click to vote
DBPL
2007
Springer
15 years 11 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
212
click to vote
ICLP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...