4573 search results - page 819 / 915 » Automated Reasoning |
CSL
2005
Springer
15 years 5 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
107
click to vote
CSL
2005
Springer
15 years 5 months ago
2005
Springer
ce, the publication of the abstract of the thesis and the citation in the CSL proceedings, and travel support to attend the conference. The first Ackermann Award is presented at t...
103
click to vote
CSL
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Girard’s Geometry of Interaction (GoI) develops a mathematical framework for modelling the dynamics of cut-elimination. We introduce a typed version of GoI, called Mult...
ECSQARU
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we explore the use of several types of structural restrictions within algorithms for learning Bayesian networks. These restrictions may codify expert knowledge in a g...
126
click to vote
ECSQARU
2005
Springer
15 years 5 months ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...