Sciweavers

342 search results - page 36 / 69
» Tableau Algorithms for Description Logics
Sort
View
IJCAI
1989
13 years 9 months ago
Unrestricted And-Parallel Execution of Logic Programs with Dependency Directed Backtracking
A model of unrestricted And-parallel execution for logic programs is described, based on Dependency Directed Backtracking (DDBT) aimed at improving the efficiency of execution whi...
Nikos Drakos
CAV
1998
Springer
138views Hardware» more  CAV 1998»
14 years 28 days ago
Model Checking for a First-Order Temporal Logic Using Multiway Decision Graphs
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
Ying Xu, Eduard Cerny, Xiaoyu Song, Francisco Core...
DLOG
2003
13 years 10 months ago
Computing Least Common Subsumers for FLE+
Transitive roles are important for adequate representation of knowledge in a range of applications. In this paper we present a first algorithm to compute least common subsumers i...
Sebastian Brandt, Anni-Yasmin Turhan
ER
2007
Springer
89views Database» more  ER 2007»
14 years 2 months ago
On Order Dependencies for the Semantic Web
We consider the problem of adding both equality and order generating dependencies to Web ontology languages such as OWL DL that are based on description logics. Such dependencies u...
David Toman, Grant E. Weddell
ASIAN
1998
Springer
99views Algorithms» more  ASIAN 1998»
14 years 28 days ago
Eventuality in LOTOS with a Disjunction Operator
LOTOS is a formal specification language, designed for the precise description of open distributed systems and protocols. Our purpose is to introduce the operators of logics (for e...
Yoshinao Isobe, Yutaka Sato, Kazuhito Ohmaki