4401 search results - page 235 / 881 » Computing with Default Logic |
143
click to vote
TLCA
2009
Springer
15 years 12 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
148
Voted
ICON
2007
IEEE
15 years 11 months ago
2007
IEEE
—IETF ForCES (Forwarding and Control Element Separation) is defining specifications for interfaces and modular resources abstractions in open programmable network equipments. Acc...
128
click to vote
SUM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
162
click to vote
CSL
2003
Springer
15 years 10 months ago
2003
Springer
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...
165
click to vote
STACS
1999
Springer
15 years 9 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...