Sciweavers

616 search results - page 33 / 124
» Bounded Model Checking with Description Logic Reasoning
Sort
View
CSL
2009
Springer
15 years 6 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
ER
2007
Springer
167views Database» more  ER 2007»
15 years 7 months ago
An Unified Dynamic Description Logic Model for Databases: Relational Data, Relational Operations and Queries
The paper presents an unified Description Logic (DL) model for databases. Describing database models using DLs is a fundamental problem in many areas because it turns databases to...
Guoshun Hao, Shilong Ma, Yuefei Sui, Jianghua Lv
JACM
2010
137views more  JACM 2010»
15 years 1 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
VVEIS
2007
15 years 4 months ago
Checking Properties of Business Process Models with Logic Programming
Logic programming has been successfully used for reasoning about various kinds of models. However, in the area of business-process modeling it has not yet gained the attention it d...
Volker Gruhn, Ralf Laue
DSOM
2004
Springer
15 years 8 months ago
A Formal Validation Model for the Netconf Protocol
Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate...
Sylvain Hallé, Rudy Deca, Omar Cherkaoui, R...