4573 search results - page 695 / 915 » Automated Reasoning |
163
Voted
ASP
2005
Springer
15 years 9 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
158
Voted
ASP
2005
Springer
15 years 9 months ago
2005
Springer
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...
122
Voted
CSL
2005
Springer
15 years 9 months ago
2005
Springer
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
118
Voted
CSL
2005
Springer
15 years 9 months ago
2005
Springer
We give a Natural Deduction formulation of an adaptation of G¨odel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proof...
128
Voted
ECSQARU
2005
Springer
15 years 9 months ago
2005
Springer
In a Bayesian network with continuous variables containing a variable(s) that is a conditionally deterministic function of its continuous parents, the joint density function for t...