Results 1  10
of
1,786
Description Logic Programs: Combining Logic Programs with Description Logic
, 2002
"... We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) ..."
Abstract

Cited by 529 (46 self)
 Add to MetaCart
) contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL) which is an expressive fragment of firstorder logic (FOL). DLP provides a significant degree of expressiveness, substantially greater than the RDFSchema fragment of Description Logic.
Decidable Fragments of FirstOrder Temporal Logics
, 1999
"... In this paper, we introduce a new fragment of the firstorder temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time ..."
Abstract

Cited by 96 (27 self)
 Add to MetaCart
structures can be reduced to the satisfiability problem for a certain fragment of classical firstorder logic. This reduction is then used to single out a number of decidable fragments of firstorder temporal logics and of twosorted firstorder logics in which one sort is intended for temporal reasoning
Decidable Fragments of FirstOrder Modal Logics
 JOURNAL OF SYMBOLIC LOGIC
, 1999
"... The paper considers the set ML1 of firstorder polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using a mosaic technique, we prove a general satisfiability criterion for formulas in ML1, which reduces the modal satisfiability to the classica ..."
Abstract

Cited by 30 (8 self)
 Add to MetaCart
The paper considers the set ML1 of firstorder polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using a mosaic technique, we prove a general satisfiability criterion for formulas in ML1, which reduces the modal satisfiability
On the Decision Problem for TwoVariable FirstOrder Logic
, 1997
"... We identify the computational complexity of the satisfiability problem for FO², the fragment of firstorder logic consisting of all relational firstorder sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity ..."
Abstract

Cited by 83 (1 self)
 Add to MetaCart
We identify the computational complexity of the satisfiability problem for FO², the fragment of firstorder logic consisting of all relational firstorder sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity
Checking Satisfiability of FirstOrder Formulas by Incremental Translation to SAT
 IN PROC. OF THE COMPUTER AIDED VERICATION (CAV'02), LNCS
, 2002
"... In the past few years, generalpurpose propositional satisfiability (SAT) solvers have improved dramatically in performance and have been used to tackle many new problems. It has also been shown that certain simple fragments of firstorder logic can be decided efficiently by first translating the pr ..."
Abstract

Cited by 98 (12 self)
 Add to MetaCart
In the past few years, generalpurpose propositional satisfiability (SAT) solvers have improved dramatically in performance and have been used to tackle many new problems. It has also been shown that certain simple fragments of firstorder logic can be decided efficiently by first translating
Firstorder satisfiability in Gödel logics: an NPcomplete fragment
, 2011
"... Defined over sets of truth values V which are closed subsets of [0, 1] containing both 0 and 1, Gödel logics GV are prominent examples of manyvalued logics. We investigate a firstorder fragment of GV extended with ∆ that is powerful enough to formalize important properties of fuzzy rulebased syst ..."
Abstract
 Add to MetaCart
Defined over sets of truth values V which are closed subsets of [0, 1] containing both 0 and 1, Gödel logics GV are prominent examples of manyvalued logics. We investigate a firstorder fragment of GV extended with ∆ that is powerful enough to formalize important properties of fuzzy rule
Combinations of theories for decidable fragments of firstorder logic
"... Abstract. The design of decision procedures for firstorder theories and their combinations has been a very active research subject for thirty years; it has gained practical importance through the development of SMT (satisfiability modulo theories) solvers. Most results concentrate on combining deci ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
; every satisfiable set of literals in a stably infinite theory has an infinite model. In this paper we consider some of the bestknown decidable fragments of firstorder logic with equality, including the Löwenheim class (monadic FOL with equality, but without functions), Bernays
Modal Languages And Bounded Fragments Of Predicate Logic
, 1996
"... Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size ..."
Abstract

Cited by 273 (12 self)
 Add to MetaCart
Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size
Noncyclic sorts for firstorder satisfiability
"... Abstract. In this paper we investigate the finite satisfiability problem for firstorder logic. We show that the finite satisfiability problem can be represented as a sequence of satisfiability problems in a fragment of manysorted logic, which we call the noncyclic fragment. The noncyclic fragment ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. In this paper we investigate the finite satisfiability problem for firstorder logic. We show that the finite satisfiability problem can be represented as a sequence of satisfiability problems in a fragment of manysorted logic, which we call the noncyclic fragment. The non
Results 1  10
of
1,786