Sciweavers

444 search results - page 47 / 89
» Automated Logical Verification Based on Trace Abstractions
Sort
View
LOPSTR
2004
Springer
15 years 9 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
DLOG
2008
15 years 6 months ago
A Survey of Revision Approaches in Description Logics
Abstract. Revision of a Description Logic-based ontology to incorporate newly received information consistently is an important problem for the lifecycle of ontologies. Many approa...
Guilin Qi, Fangkai Yang
ILP
1997
Springer
15 years 8 months ago
A Logical Framework for Graph Theoretical Decision Tree Learning
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Peter Geibel, Fritz Wysotzki
CADE
2006
Springer
16 years 4 months ago
Partial Recursive Functions in Higher-Order Logic
Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for ...
Alexander Krauss
LICS
2010
IEEE
15 years 2 months ago
Breaking Paths in Atomic Flows for Classical Logic
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
Alessio Guglielmi, Tom Gundersen, Lutz Straß...