2585 search results - page 184 / 517 » Automating Coherent Logic |
159
click to vote
LOPSTR
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. A formal and effective approach to the extension of the computational behaviour of logic programs is presented. The approach builds upon the following concepts. The exte...
150
click to vote
TARK
1998
Springer
15 years 10 months ago
1998
Springer
: Salmetintroduced a notion of hypothetical knowledge and showed how it could be used to capture the type of counterfactual reasoning necessary to force the backwards induction sol...
151
click to vote
TIME
1994
IEEE
15 years 10 months ago
1994
IEEE
The frame problem was originally de ned in the context of the situation calculus. The problem also manifests itself in more sophisticated temporal logics that can represent interv...
154
click to vote
LICS
1989
IEEE
15 years 10 months ago
1989
IEEE
A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the...
148
click to vote
LICS
1990
IEEE
15 years 10 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...