Sciweavers

2022 search results - page 178 / 405
» Complexity of Non-Monotonic Logics
Sort
View
DOOD
1993
Springer
135views Database» more  DOOD 1993»
15 years 10 months ago
A Deductive and Typed Object-Oriented Language
In this paper we introduce a logical query language extended with object-oriented typing facilities. This language, called DTL (from DataTypeLog), can be seen as an extension of Da...
René Bal, Herman Balsters
DAM
2007
83views more  DAM 2007»
15 years 6 months ago
The proof theoretic strength of the Steinitz exchange theorem
We show that the logical theory QLA proves the Cayley–Hamilton theorem from the Steinitz exchange theorem together with a strengthening of the linear independence principle. Sin...
Michael Soltys
AAMAS
2004
Springer
15 years 6 months ago
Temporal Development Methods for Agent-Based
In this paper we overview one specific approach to the formal development of multi-agent systems. This approach is based on the use of temporal logics to represent both the behavio...
Michael Fisher
ENTCS
2002
103views more  ENTCS 2002»
15 years 6 months ago
Deciding low levels of tree-automata hierarchy
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
Igor Walukiewicz
APAL
1999
88views more  APAL 1999»
15 years 6 months ago
A Simple Propositional S5 Tableau System
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
Melvin Fitting