Sciweavers

1157 search results - page 50 / 232
» Descriptive Complexity and Model Checking
Sort
View
DLOG
2010
13 years 8 months ago
Checking Full Satisfiability of Conceptual Models
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
JAPLL
2010
179views more  JAPLL 2010»
13 years 8 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
ISMIR
2004
Springer
112views Music» more  ISMIR 2004»
14 years 3 months ago
Perceptual Segment Clustering For Music Description And Time-axis Redundancy Cancellation
Repeating sounds and patterns are widely exploited throughout music. However, although analysis and music information retrieval applications are often concerned with processing sp...
Tristan Jehan
LPAR
2000
Springer
14 years 1 months ago
On the Complexity of Theory Curbing
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
Thomas Eiter, Georg Gottlob
COLING
1992
13 years 11 months ago
On the Satisfiability of Complex Constraints
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
Luís Damas, Giovanni B. Varile