2585 search results - page 436 / 517 » Automating Coherent Logic |
LOPSTR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
100
Voted
RSCTC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper focuses on the use and interpretation of approximate databases where both rough sets and indiscernibility partitions are generalized and replaced by approximat...
104
Voted
LICS
2003
IEEE
15 years 6 months ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
92
Voted
TIME
2003
IEEE
15 years 6 months ago
2003
IEEE
In bitemporal databases, current facts and transaction states are modelled using a special value to represent the current time (such as a minimum or maximum timestamp or NULL). Pr...
89
Voted
ICLP
2003
Springer
15 years 6 months ago
2003
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...