4617 search results - page 561 / 924 » Automation of Diagrammatic Reasoning |
206
click to vote
LOPSTR
2004
Springer
16 years 29 days ago
2004
Springer
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
183
click to vote
LOPSTR
2004
Springer
16 years 29 days 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...
207
click to vote
LPNMR
2004
Springer
16 years 29 days ago
2004
Springer
Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the que...
220
click to vote
NMR
2004
Springer
16 years 29 days ago
2004
Springer
One of the crucial actions any reasoning system must undertake is the updating of its Knowledge Base (KB). This problem is usually referred to as the problem of belief change. The...
252
click to vote
TIME
2003
IEEE
16 years 26 days ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...