2035 search results - page 56 / 407 » On the complexity of stratified logics |
166
click to vote
LATA
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
141
click to vote
ICDAR
2003
IEEE
15 years 11 months ago
2003
IEEE
Structure analysis of table form document is important because printed documents and also electronical documents only provide geometrical layout and lexical information explicitly...
186
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a...
139
click to vote
FCS
2007
15 years 7 months ago
2007
Instances of the futile questioning problem abound in applications, especially, in the area of artificial intelligence. The problem can be represented by a particular quantified ...
166
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
The main contribution of this paper is the definition of the preference description language ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...