Sciweavers

64 search results - page 2 / 13
» Tractable Classes for Directional Resolution
Sort
View
AMAI
2007
Springer
13 years 5 months ago
Automated theorem proving by resolution in non-classical logics
This paper is an overview of a variety of results, all centered around a common theme, namely embedding of non-classical logics into first order logic and resolution theorem prov...
Viorica Sofronie-Stokkermans
IJCAI
1997
13 years 6 months ago
Tractable Cover Compilations
Tractable covers are introduced as a new ap­ proach to equivalence-preserving compilation of propositional knowledge bases. First, a gen­ eral framework is presented. Then, two ...
Yacine Boufkhad, Éric Grégoire, Pier...
MOC
2002
118views more  MOC 2002»
13 years 5 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
ICDT
1997
ACM
138views Database» more  ICDT 1997»
13 years 9 months ago
Tractable Iteration Mechanisms for Bag Languages
Abstract. The goal of this paper is to study tractable iteration mechanisms for bags. The presence of duplicates in bags prevents iteration mechanisms developed in the context of s...
Latha S. Colby, Leonid Libkin
UAI
2003
13 years 6 months ago
Layerwidth: Analysis of a New Metric for Directed Acyclic Graphs
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
Mark Hopkins