211 search results - page 4 / 43 » Ground Reducibility is EXPTIME-Complete |
139
click to vote
JAIR
2010
15 years 2 months ago
2010
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
129
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We prove that observational equivalence of IA3 + Y0 (3rdorder Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable...
VLSID
2003
IEEE
16 years 4 months ago
2003
IEEE
In this paper, we provide an analytical framework to study the inter-cell and intra-cell bit-line coupling when it is superimposed with the ground bounce effect and show how those...
137
click to vote
GEOS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Grounding an ontology upon geographical data has been proposed as a method of handling the vagueness in the domain more effectively. In order to do this, we require meth...
140
click to vote
Publication
Most implementations of the language Refal represent ground expressions by doubly-linked lists, which results in low-cost concatenation. On the other hand, that representation nece...