Sciweavers

6167 search results - page 957 / 1234
» Can Refinement be Automated
Sort
View
LPNMR
2009
Springer
15 years 10 months ago
A Deductive System for FO(ID) Based on Least Fixpoint Logic
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
Ping Hou, Marc Denecker
PKDD
2009
Springer
136views Data Mining» more  PKDD 2009»
15 years 10 months ago
Integrating Logical Reasoning and Probabilistic Chain Graphs
Probabilistic logics have attracted a great deal of attention during the past few years. While logical languages have taken a central position in research on knowledge representati...
Arjen Hommersom, Nivea de Carvalho Ferreira, Peter...
141
Voted
RWEB
2009
Springer
15 years 10 months ago
Description Logics
In this chapter we will introduce description logics, a family of logic-based knowledge representation languages that can be used to represent the terminological knowledge of an a...
Franz Baader
SAFECOMP
2009
Springer
15 years 10 months ago
Probabilistic Failure Propagation and Transformation Analysis
A key concern in safety engineering is understanding the overall emergent failure behaviour of a system, i.e., behaviour exhibited by the system that is outside its specification ...
Xiaocheng Ge, Richard F. Paige, John A. McDermid
SEMWEB
2009
Springer
15 years 10 months ago
Optimizing Web Service Composition While Enforcing Regulations
Abstract. To direct automated Web service composition, it is compelling to provide a template, workflow or scaffolding that dictates the ways in which services can be composed. I...
Shirin Sohrabi, Sheila A. McIlraith