15 search results - page 2 / 3 » The Complexity of Independence-Friendly Fixpoint Logic |
150
click to vote
IPL
2006
15 years 5 months ago
2006
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
169
click to vote
DLOG
2003
15 years 7 months ago
2003
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Descripti...
135
click to vote
LFCS
2009
Springer
16 years 6 days ago
2009
Springer
We present FixIt(ALC), a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL) ALC. FixIt(ALC) does not search for tree-structured m...
169
click to vote
FSTTCS
2005
Springer
15 years 11 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
148
click to vote
LPNMR
1997
Springer
15 years 9 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...