1670 search results - page 70 / 334 » On Skolemization in constructive theories |
ICDT
2010
ACM
14 years 11 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
COMBINATORICS
2000
14 years 11 months ago
2000
The known methods for constructing complete sets of mutually orthogonal frequency squares all yield one of two parameter sets. We show that almost all these constructions can be d...
117
click to vote
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
An important part of the computer science is focused on the links that can be established between group theory and graph theory. Cayley graphs can establish such a link but meet so...
AAAI
1994
15 years 1 months ago
1994
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
SYNTHESE
2011
14 years 6 months ago
2011
: My aim in this paper is to articulate an account of scientific modeling that reconciles pluralism about modeling with a modest form of scientific realism. The central claim of th...