2022 search results - page 36 / 405 » Complexity of Non-Monotonic Logics |
85
Voted
CADE
2008
Springer
15 years 8 days ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
97
Voted
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
80
Voted
AI
2002
Springer
14 years 10 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
121
Voted
USS
2010
14 years 8 months ago
2010
Web applications are the most common way to make services and data available on the Internet. Unfortunately, with the increase in the number and complexity of these applications, ...
120
Voted
CORR
2011
Springer
14 years 2 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...