Sciweavers

3686 search results - page 549 / 738
» Comprehensive comprehensions
Sort
View
131
Voted
JAIR
2010
111views more  JAIR 2010»
15 years 1 months ago
Grounding FO and FO(ID) with Bounds
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...
Johan Wittocx, Maarten Mariën, Marc Denecker
JASIS
2010
125views more  JASIS 2010»
15 years 1 months ago
So mechanical or routine: The not original in Feist
The United States Supreme Court case of 1991, Feist Publications, Inc. v. Rural Tel. Service Co., continues to be highly significant for property in data and databases but remains...
Julian Warner
JASIS
2010
316views more  JASIS 2010»
15 years 1 months ago
Information sources and perceived success in corporate finance
: The work of corporate finance professionals is information intensive. In spite of that the practices and motivations of their information preferences have been researched very li...
Isto Huvila
JCSS
2010
111views more  JCSS 2010»
15 years 1 months ago
Reduction rules for reset/inhibitor nets
Abstract. Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. A reset arc allows a transition to remove all tokens from a certain place when the transi...
H. M. W. Verbeek, Moe Thandar Wynn, Wil M. P. van ...
116
Voted
JUCS
2010
107views more  JUCS 2010»
15 years 1 months ago
Systematic Unit Testing in a Read-eval-print Loop
: Lisp programmers constantly carry out experiments in a read-eval-print loop. The experimental activities convince the Lisp programmers that new or modified pieces of programs wo...
Kurt Nørmark