Sciweavers

7988 search results - page 62 / 1598
» A Useful Undecidable Theory
Sort
View
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 9 months ago
On combinations of local theory extensions
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
Viorica Sofronie-Stokkermans
TABLEAUX
2005
Springer
14 years 2 months ago
A Tableau Algorithm for Description Logics with Concrete Domains and GCIs
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extensio...
Carsten Lutz, Maja Milicic
CONCUR
2007
Springer
14 years 3 months ago
Causal Message Sequence Charts
Scenario languages based on Message Sequence Charts (MSCs) have been widely studied in the last decade [21,20,3,15,12,19,14]. The high expressive power of MSCs renders many basic ...
Thomas Gazagnaire, Blaise Genest, Loïc H&eacu...
ICDT
2011
ACM
270views Database» more  ICDT 2011»
13 years 10 days ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis
KR
1992
Springer
14 years 28 days ago
Embedding Defaults into Terminological Knowledge Representation Formalisms
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
Franz Baader, Bernhard Hollunder