4401 search results - page 265 / 881 » Computing with Default Logic |
148
Voted
IJCAI
2003
15 years 7 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
149
click to vote
COLING
1992
15 years 6 months ago
1992
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
175
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
169
click to vote
TCS
2010
15 years 4 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
162
click to vote
ACL
2009
15 years 3 months ago
2009
Recent work on temporal relation identification has focused on three types of relations between events: temporal relations between an event and a time expression, between a pair o...