3690 search results - page 484 / 738 » Computation with classical sequents |
218
click to vote
ICLP
1994
Springer
15 years 10 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
177
click to vote
ECAI
1992
Springer
15 years 10 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
172
click to vote
REX
1993
15 years 10 months ago
1993
Abstract. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling...
184
click to vote
WG
1993
Springer
15 years 10 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
179
click to vote
EICS
2010
ACM
15 years 10 months ago
2010
ACM
Language Technology (LT) based applications become more popular as technology improves. Prototyping early in the design process is critical for the development of high quality app...