Sciweavers

846 search results - page 83 / 170
» On the Computational Complexity of Spatio-Temporal Logics
Sort
View
125
Voted
TPLP
2002
117views more  TPLP 2002»
15 years 11 days ago
On Properties of Update Sequences Based on Causal Rejection
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
102
Voted
DLOG
2007
15 years 3 months ago
Modularity in DL-Lite
We develop a formal framework for modular ontologies by analysing four notions of conservative extensions and their applications in refining, re-using, merging, and segmenting ont...
Roman Kontchakov, Frank Wolter, Michael Zakharyasc...
SEKE
2004
Springer
15 years 6 months ago
Application Semiotics Engineering Process
As application semantics becomes more complex and dynamic in IT systems, it is necessary to engineer the application semantics in its own lifecycle of development parallel to syste...
Gang Zhao
SBCCI
2004
ACM
111views VLSI» more  SBCCI 2004»
15 years 6 months ago
A partial reconfigurable architecture for controllers based on Petri nets
Digital Control System in the industry has been used in most of the applications based on expensive Programmable Logical Controllers (PLC). These Systems are, in general, highly c...
Paulo Sérgio B. do Nascimento, Paulo Romero...
94
Voted
CONCUR
1999
Springer
15 years 5 months ago
Robust Satisfaction
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
Orna Kupferman, Moshe Y. Vardi