Sciweavers

598 search results - page 82 / 120
» Independence Semantics for BKBs
Sort
View
KBSE
2007
IEEE
15 years 6 months ago
Ensuring consistency in long running transactions
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
Jeffrey Fischer, Rupak Majumdar
ICEIS
2005
IEEE
15 years 5 months ago
Conditions for Interoperability
Abstract: Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases nee...
B. Nick Rossiter, Michael A. Heather
COOPIS
2002
IEEE
15 years 4 months ago
Formal Ontology Engineering in the DOGMA Approach
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
Mustafa Jarrar, Robert Meersman
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 4 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
FUIN
2010
130views more  FUIN 2010»
14 years 10 months ago
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
Fabrizio Riguzzi