排序方式: 共有186条查询结果,搜索用时 20 毫秒
161.
Why Combine Logics? 总被引:1,自引:0,他引:1
Combining logics has become a rapidly expanding entreprise that is inspired mainly by concerns about modularity and the wish to join together tailor made logical tools into more powerful but still manageable ones. A natural question is whether it offers anything new over and above existing standard languages.By analysing a number of applications where combined logics arise, we argue that combined logics are a potentially valuable tool in applied logic, and that endorsements of standard languages often miss the point. Using the history of quantified modal logic as our main example, we also show that the use of combined structures and logics is a recurring theme in the analysis of existing logical systems. 相似文献
162.
In order to capture the concept of common knowledge, various extensions of multi-modal epistemic logics, such as fixed-point ones and infinitary ones, have been proposed. Although we have now a good list of such proposed extensions, the relationships among them are still unclear. The purpose of this paper is to draw a map showing the relationships among them. In the propositional case, these extensions turn out to be all Kripke complete and can be comparable in a meaningful manner. F. Wolter showed that the predicate extension of the Halpern-Moses fixed-point type common knowledge logic is Kripke incomplete. However, if we go further to an infinitary extension, Kripke completeness would be recovered. Thus there is some gap in the predicate case. In drawing the map, we focus on what is happening around the gap in the predicate case. The map enables us to better understand the common knowledge logics as a whole. 相似文献
163.
A Proof of Standard Completeness for Esteva and Godo's Logic MTL 总被引:7,自引:0,他引:7
In the present paper we show that any at most countable linearly-ordered commutative residuated lattice can be embedded into a commutative residuated lattice on the real unit interval [0, 1]. We use this result to show that Esteva and Godo's logic MTL is complete with respect to interpretations into commutative residuated lattices on [0, 1]. This solves an open problem raised in. 相似文献
164.
We present a general framework for proof systems for relational theories. We discuss principles of the construction of deduction rules and correspondences reflecting relationships between semantics of relational logics and the rules of the respective proof systems. We illustrate the methods developed in the paper with examples relevant for the Lambek calculus and some of its extensions. 相似文献
165.
This paper develops a new proof method for two propositional paraconsistent logics: the propositional part of Batens' weak
paraconsistent logic CLuN and Schütte's maximally paraconsistent logic Φv. Proofs are de.ned as certain sequences of questions. The method is grounded in Inferential Erotetic Logic. 相似文献
166.
The seven virtues of simple type theory 总被引:2,自引:0,他引:2
Simple type theory, also known as higher-order logic, is a natural extension of first-order logic which is simple, elegant, highly expressive, and practical. This paper surveys the virtues of simple type theory and attempts to show that simple type theory is an attractive alternative to first-order logic for practical-minded scientists, engineers, and mathematicians. It recommends that simple type theory be incorporated into introductory logic courses offered by mathematics departments and into the undergraduate curricula for computer science and software engineering students. 相似文献
167.
In this paper, we provide a logical formalization of the emotion triggering process and of its relationship with mental attitudes,
as described in Ortony, Clore, and Collins’s theory. We argue that modal logics are particularly adapted to represent agents’
mental attitudes and to reason about them, and use a specific modal logic that we call Logic of Emotions in order to provide
logical definitions of all but two of their 22 emotions. While these definitions may be subject to debate, we show that they
allow to reason about emotions and to draw interesting conclusions from the theory. 相似文献
168.
169.
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guarding knowledge representation mechanisms such as negation as failure and inequalities. Reasoning with the resulting extended forest logic programs (EFoLPs) can be reduced to finite answer set programming, for which reasoners are available.We argue that extended forest logic programming is a useful tool for uniformly representing and reasoning with both ontological and rule-based knowledge, as they can capture a large fragment of the OWL DL ontology language equipped with DL-safe rules. Furthermore, EFoLPs enable nonmonotonic reasoning, a desirable feature in locally closed subareas of the Semantic Web. 相似文献
170.
The Fluent Calculus belongs to the established predicate calculus formalisms for reasoning about actions. Its underlying concept of state update axioms provides a solution to the basic representational and inferential Frame Problems in pure first-order logic. Extending a recent research result, we present a Fluent Calculus to reason about domains involving continuous change and where actions occur concurrently. 相似文献