Sciweavers

1404 search results - page 65 / 281
» Complexity of admissible rules
Sort
View
CSR
2007
Springer
14 years 4 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
STORYTELLING
2007
Springer
14 years 4 months ago
Wide Ruled: A Friendly Interface to Author-Goal Based Story Generation
We present Wide Ruled, an authoring tool for the creation of generative stories. It is based on the Universe author-goal-based model of story generation, and extends this model by ...
James Skorupski, Lakshmi Jayapalan, Sheena Marquez...
LPAR
2004
Springer
14 years 3 months ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
GEOS
2009
Springer
14 years 2 months ago
SPARQL Query Re-writing Using Partonomy Based Transformation Rules
Abstract. Often the information present in a spatial knowledge base is represented at a different level of granularity and abstraction than the query constraints. For querying onto...
Prateek Jain, Peter Z. Yeh, Kunal Verma, Cory A. H...
HYBRID
1998
Springer
14 years 2 months ago
High Order Eigentensors as Symbolic Rules in Competitive Learning
We discuss properties of high order neurons in competitive learning. In such neurons, geometric shapes replace the role of classic `point' neurons in neural networks. Complex ...
Hod Lipson, Hava T. Siegelmann