Sciweavers

193 search results - page 17 / 39
» On the Epistemological foundations of Logic Programming and ...
Sort
View
ICALP
2009
Springer
15 years 4 months ago
Decidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quantiers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
Jakub Michaliszyn
IJCAI
2007
15 years 1 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
2005
Springer
15 years 5 months ago
a-logic
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
Murdoch Gabbay, Michael Gabbay
CACM
2010
97views more  CACM 2010»
14 years 9 months ago
Certified software
Certified software consists of a machine-executable program plus a formal machine-checkable proof that the software is free of bugs with respect to a claim of dependability. The c...
Zhong Shao
ER
2007
Springer
130views Database» more  ER 2007»
15 years 5 months ago
Towards Automated Reasoning on ORM Schemes
The goal of this article is to formalize Object Role Modeling (ORM) using the DLR description logic. This would enable automated reasoning on the formal properties of ORM diagrams,...
Mustafa Jarrar