Results 1 - 10
of
12,256
Global Definability in Basic Modal Logic
"... We present results on global definability in basic modal logic, and contrast our model-theoretic results and proof techniques with known results about local definability. ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
We present results on global definability in basic modal logic, and contrast our model-theoretic results and proof techniques with known results about local definability.
The data complexity of MDatalog in basic modal logics
- Proceedings of MFCS 2006, LNCS 4162
, 2006
"... Abstract. We study the data complexity of the modal query language MDatalog and its extension eMDatalog in basic modal logics. MDatalog is a modal extension of Datalog, while eMDatalog is the general modal Horn fragment with the allowedness condition. As the main results, we prove that the data comp ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
Abstract. We study the data complexity of the modal query language MDatalog and its extension eMDatalog in basic modal logics. MDatalog is a modal extension of Datalog, while eMDatalog is the general modal Horn fragment with the allowedness condition. As the main results, we prove that the data
Temporal and modal logic
- HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract
-
Cited by 1310 (17 self)
- Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Dynamic Logic
- Handbook of Philosophical Logic
, 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract
-
Cited by 1012 (7 self)
- Add to MetaCart
the effect of the execution of a program on the truth of a formula ', DL uses a modal construct <>', which
The Semantics Of Constraint Logic Programs
- JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a self-contained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract
-
Cited by 872 (14 self)
- Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a self-contained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new
Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- J. OF AUTOMATED REASONING
, 2007
"... We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract
-
Cited by 497 (123 self)
- Add to MetaCart
We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base
AgentSpeak(L): BDI Agents speak out in a logical computable language
, 1996
"... Belief-Desire-Intention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theorem-prov ..."
Abstract
-
Cited by 514 (2 self)
- Add to MetaCart
-proving or model-checking in these expressive specification logics. Hence, the implemented BDI systems have tended to use the three major attitudes as data structures, rather than as modal operators. In this paper, we provide an alternative formalization of BDI agents by providing an operational and proof
Many-Valued Modal Logics
- Fundamenta Informaticae
, 1992
"... . Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds a ..."
Abstract
-
Cited by 273 (16 self)
- Add to MetaCart
development of mathematics, artificial intelligence has found uses for modal, temporal, relevant, and many-valued logics, among others. Indeed, I take it as a basic principle that an application should find (or create) an appropriate logic, if it needs one, rather than reshape the application to fit some
Bayesian Description Logics. In:
- Proc. of DL’14. CEUR Workshop Proceedings,
, 2014
"... Abstract This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics as a modeling language. In particular, it addresses the extensions concerning: concrete domain constraints; moda ..."
Abstract
-
Cited by 394 (49 self)
- Add to MetaCart
Abstract This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics as a modeling language. In particular, it addresses the extensions concerning: concrete domain constraints
Results 1 - 10
of
12,256