4126 search results - page 563 / 826 » Set based logic programming |
129
click to vote
AAAI
1994
15 years 4 months ago
1994
Formalizing the ontological commitment of a logical language means offering a way to specify the intended meaning of its vocabulary by constraining the set of its models, giving e...
132
click to vote
AUTOMATICA
2008
15 years 3 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
122
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
144
click to vote
IJDAR
2002
15 years 3 months ago
2002
We present a document analysis system able to assign logical labels and extract the reading order in a broad set of documents. All information sources, from geometric features and ...
126
Voted
DLOG
2009
15 years 1 months ago
2009
We report on event recognition within the life logging application IYOUIT for the automatic creation of static diary-like Blogs. Based on the qualitative context histories produced...