Sciweavers

8766 search results - page 535 / 1754
» Functional logic programming
Sort
View
CADE
2005
Springer
16 years 5 months ago
Deciding Monodic Fragments by Temporal Resolution
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
Ullrich Hustadt, Boris Konev, Renate A. Schmidt
CADE
2003
Springer
16 years 5 months ago
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...
Renate A. Schmidt, Ullrich Hustadt
ICFCA
2004
Springer
15 years 10 months ago
Background Knowledge in Concept Graphs
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...
Frithjof Dau
APAL
2006
118views more  APAL 2006»
15 years 4 months ago
Final coalgebras and the Hennessy-Milner property
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (small class) of formulas that has the Hennessy-Milner property of distinguishing co...
Robert Goldblatt
CSL
2004
Springer
15 years 10 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...