Sciweavers

1138 search results - page 4 / 228
» First-Order Model Checking Problems Parameterized by the Mod...
Sort
View
IJCAI
2007
13 years 9 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
BIRTHDAY
2010
Springer
13 years 6 months ago
Specifying and Verifying Organizational Security Properties in First-Order Logic
In certain critical cases the data flow between business departments in banking organizations has to respect security policies known as Chinese Wall or Bell–La Padula. We show t...
Christoph Brandt, Jens Otten, Christoph Kreitz, Wo...
CSL
2009
Springer
13 years 11 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
SIAMNUM
2010
105views more  SIAMNUM 2010»
13 years 2 months ago
Quantization Based Filtering Method Using First Order Approximation
The quantization based filtering method (see [13], [14]) is a grid based approximation method to solve nonlinear filtering problems with discrete time observations. It relies on o...
Afef Sellami
CADE
2005
Springer
14 years 8 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill