1151 search results - page 86 / 231 » Collaborative Programming: Applications of Logic and Automat... |
211
Voted
ICTL
1994
15 years 7 months ago
1994
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
138
Voted
ICLP
2007
Springer
15 years 9 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
111
Voted
ICLP
2007
Springer
15 years 9 months ago
2007
Springer
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
137
Voted
LPNMR
2007
Springer
15 years 9 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
140
Voted
LOPSTR
2004
Springer
15 years 9 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...