91 search results - page 3 / 19 » On Computing Backbones of Propositional Theories |
AAAI
2006
13 years 6 months ago
2006
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
SYNASC
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by ...
AAAI
1990
13 years 6 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
BIRTHDAY
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
AMAST
2006
Springer
13 years 8 months ago
2006
Springer
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, seve...