Sciweavers

11160 search results - page 355 / 2232
» Incompleteness in a General Setting
Sort
View
IJAR
2008
99views more  IJAR 2008»
15 years 6 months ago
Unifying practical uncertainty representations. II: Clouds
There exist many tools for capturing imprecision in probabilistic representations. Among them are random sets, possibility distributions, probability intervals, and the more recen...
Sébastien Destercke, Didier Dubois, Eric Ch...
RULEML
2005
Springer
16 years 8 days ago
Merging and Aligning Ontologies in dl-Programs
Abstract. The language of dl-programs is a latest effort in developing an expressive representation for Web-based ontologies. It allows to build answer set programming (ASP) on top...
Kewen Wang, Grigoris Antoniou, Rodney W. Topor, Ab...
SODA
2004
ACM
108views Algorithms» more  SODA 2004»
15 years 8 months ago
A certifying algorithm for the consecutive-ones property
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
Ross M. McConnell
158
Voted
CCCG
2010
15 years 8 months ago
Compatible pointed pseudo-triangulations
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjo...
Thomas Hackl, Oswin Aichholzer, Birgit Vogtenhuber
LPNMR
2005
Springer
16 years 8 days ago
Loops: Relevant or Redundant?
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
Martin Gebser, Torsten Schaub