2022 search results - page 63 / 405 » Complexity of Non-Monotonic Logics |
AAAI
1990
15 years 1 months ago
1990
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
106
click to vote
LATA
2010
Springer
15 years 10 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...
ICDAR
2003
IEEE
15 years 6 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...
117
Voted
BIRTHDAY
2008
Springer
15 years 2 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...
FCS
2007
15 years 2 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 ...