Sciweavers

1061 search results - page 68 / 213
» Dependently Sorted Logic
Sort
View
DLOG
2007
14 years 9 days ago
Adding ABoxes to a Description Logic with Uniqueness Constraints via Path Agreements
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
Vitaliy L. Khizder, David Toman, Grant E. Weddell
AAAI
1998
13 years 11 months ago
Fixpoint 3-Valued Semantics for Autoepistemic Logic
The paper presents a constructive 3-valued semantics for autoepistemic logic (AEL). We introduce a derivation operator and de ne the semantics as its least xpoint. The semantics is...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...
CADE
2010
Springer
13 years 11 months ago
Analytic Tableaux for Higher-Order Logic with Choice
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
Julian Backes, Chad E. Brown
JAPLL
2010
111views more  JAPLL 2010»
13 years 4 months ago
The complexity of satisfiability for fragments of hybrid logic - Part I
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
Arne Meier, Martin Mundhenk, Thomas Schneider 0002...
PRDC
2007
IEEE
14 years 4 months ago
Generic Fault-Tolerance Mechanisms Using the Concept of Logical Execution Time
Model-based development has become state of the art in software engineering. Unfortunately, the used code generators often focus on the pure application functionality. Features li...
Christian Buckl, Matthias Regensburger, Alois Knol...