Sciweavers

241 search results - page 43 / 49
» Propositional knowledge and know-how
Sort
View
JAIR
2007
159views more  JAIR 2007»
14 years 9 months ago
Combination Strategies for Semantic Role Labeling
This paper introduces and analyzes a battery of inference models for the problem of semantic role labeling: one based on constraint satisfaction, and several strategies that model...
Mihai Surdeanu, Lluís Màrquez, Xavie...
CMOT
2002
90views more  CMOT 2002»
14 years 9 months ago
Organizational Design, Information Transfer, and the Acquisition of Rent-Producing Resources
Within the resource-based view of the firm, a dynamic story has emerged in which the knowledge accumulated over the history of a firm and embedded in organizational routines and s...
Michael J. Lenox
AI
1999
Springer
14 years 9 months ago
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
Holger H. Hoos, Thomas Stützle
MICS
2010
92views more  MICS 2010»
14 years 8 months ago
Specifying Rewrite Strategies for Interactive Exercises
Strategies specify how a wide range of exercises can be solved incrementally, such as bringing a logic proposition to disjunctive normal form, reducing a matrix, or calculating wit...
Bastiaan Heeren, Johan Jeuring, Alex Gerdes
AAAI
2010
14 years 7 months ago
A Lower Bound on the Size of Decomposable Negation Normal Form
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...
Thammanit Pipatsrisawat, Adnan Darwiche