共查询到20条相似文献,搜索用时 15 毫秒
1.
对应物理论(counterpart theory)是一阶逻辑的一种理论.Lewis利用谓词模态逻辑到对应物理论的翻译来研究谓词模态逻辑的性质,但是Lewis的翻译存在把不可满足的公式翻译为可满足公式的情况针对这个问题,提出了一种扩展语义的谓词模态逻辑,建立了扩展语义后谓词模态逻辑模型与对应物理论模型的一一对应关系,并在此基础上建立了谓词模态逻辑到对应物理论的语义忠实语义满翻译(faithful and full translation),其可确保将谓词模态逻辑的可满足公式和不可满足公式分别翻译为对应物理论的可满足公式和不可满足公式.由对应物理论是可靠的、完备的一阶逻辑的理论且语义忠实语义满翻译保持可靠性和完备性,进一步证明了扩展语义的谓词模态逻辑也是可靠和完备的. 相似文献
2.
3.
Extended IF 逻辑是一阶逻辑的扩张,其主要特点是可表达量词间的相互依赖和独立关系,但其命题部分至今没有得到公理化.基于Cirquent 演算方法,给出了一个关于Cirquent 语义(命题水平)可靠完备的形式系统.该系统能够很好地解释和表达命题联结词间的相互依赖和独立关系,从而使Extended IF 逻辑在命题水平得到了真正意义上的公理化. 相似文献
4.
5.
时态描述逻辑ALC-LTL的Tableau判定算法 总被引:2,自引:2,他引:0
时态描述逻辑ALC-LTL将描述逻辑ALC的描述能力与线性时态逻辑LTL的刻画能力结合起来,在具有较强描述能力的同时还使得可满足性问题保持在EXPTIME-完全这个级别。针对ALC-LTL缺少有效的判定算法的现状,将LTL的Tableau判定算法与描述逻辑ALC的推理机制有机地结合起来,给出了ALC-LTL的Tableau判定算法并证明了算法的可终止性、可靠性和完备性。该算法具有很好的可扩展性。当ALC-工`I'I、中的描述逻辑从ALC改变为任何一个具有可判定性特征的描述逻辑X时,只需要对算法进行简单修改,就可以得到相应的时态描述逻辑X-LTL的Tableau判定算法。 相似文献
6.
We present a sound, complete and relatively straightforwardtableau method for deciding valid formulas in the propositionalversion of the bundled (or suffix and fusion closed) computationtree logic BCTL*. This proves that BCTL* is decidable. It isalso moderately useful to have a tableau available for a reasonablyexpressive branching-time temporal logic. However, the maininterest in this should be that it leads us closer to beingable to devise a tableau-based technique for theorem-provingin the important full computational tree logic CTL*. 相似文献
7.
8.
An intelligent hybrid approach for industrial quality control combining neural networks, fuzzy logic and fractal theory 总被引:1,自引:0,他引:1
The application of type-2 fuzzy logic to the problem of automated quality control in sound speaker manufacturing is presented in this paper. Traditional quality control has been done by manually checking the quality of sound after production. This manual checking of the speakers is time consuming and occasionally was the cause of error in quality evaluation. For this reason, by applying type-2 fuzzy logic, an intelligent system for automated quality control in sound speaker manufacturing is developed. The intelligent system has a type-2 fuzzy rule base containing the knowledge of human experts in quality control. The parameters of the fuzzy system are tuned by applying neural networks using, as training data, a real time series of measured sounds produced by good sound speakers. The fractal dimension is used as a measure of the complexity of the sound signal. 相似文献
9.
Joshua Sack 《Journal of Logic, Language and Information》2008,17(2):183-216
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time
operator to PAL, we express in the language statements concerning the muddy children puzzle and sum and product. We also express a true statement that an agent’s beliefs about another agent’s knowledge flipped twice, and use a sound
proof system to prove this statement. Adding a next-time operator to PAL, we provide formulas that express that belief revision
does not take place in PAL. We also discuss relationships between announcements and the new knowledge agents thus acquire;
such relationships are related to learning and to Fitch’s paradox. We also show how inverse programs and hybrid logic each
can be used to help determine whether or not an arbitrary structure represents the play of a game. We then add a past-time
operator to DEL, and discuss the importance of adding yet another component to the language in order to prove completeness. 相似文献
10.
11.
12.
本文基于对蕴涵悖论的讨论,分析了已有非单调逻辑,次协调逻辑中择优蕴涵的合理性,发现由于这些择优蕴涵对结论缺少限制,从而不可避免地有从而不可避免地有蕴悖论。 相似文献
13.
将知识、信念和肯定性逻辑从单个智能体扩展到多智能体系统,并且实现了多智能体系统中知识、信念和肯定性逻辑与具有并发动态属性的行为之间的很好结合.以此为基础,提出了多智能体系统中并发动态知识、信念和肯定性逻辑,简称CDKBC逻辑.为了对CDKBC逻辑进行解释,也给出了CDKBC模型,并且讨论了知识、信念和肯定性之间的关系,即知识蕴涵着肯定性,肯定性蕴涵着信念.文中也给出了一个相应的证明系统(即公理系统),证明了该系统是可靠的和完备的,并且证明了系统的有效性问题是EXPTIME完全的.最后论文给出了CDKBC逻辑的实例. 相似文献
14.
Providing a clean procedural semantics of the Negation As Failure rule in Logic Programming has been an open problem for some time now. This rule has been treated as a technique in nonmonotonic reasoning, not as a rule in classical logic. This paper contains a demonstration of the negation as failure rule as a resolution procedure in first-order logic. We present a sound and complete resolution scheme for negation as failure rule for the larger class of constraint logic programs. The approach is to consider a canonical partition of the completion of a definite (constraint) program into the IF and the FI programs. We show that a negated goal, provable from the completed definite program is provable from just the FI part. The clauses in this program have a structure dual to that of definite Horn clauses. We describe a sound and complete linear resolution rule for this fragment, and show that a resolution proof of the negated goal from the FI part corresponds to a finite failure tree resulting from classical linear resolution applied to the goal on the If part of the original definite program. Our work shows that negation as failure rule can be computationally efficient in the sense that the SLD-resolution on the If part of a definite program along with the negation as failure rule is more efficient than a direct resolution procedure on the completion of that program. 相似文献
15.
Agent-BDI逻辑 总被引:20,自引:4,他引:16
阐述了Agent的形式化描述应该采用含有正规和非正规模态算子的混合模态逻辑为逻辑工具 的观点.建立了Agent-BDI逻辑的代表系统A-BI,讨论了它的语法和语义.特别是给出了非正 规模态算子基于Kripke标准可能世界的新的语义解释,证明了A-BI逻辑系统不但是可靠的, 而且是完备的.A-BI逻辑系统恰当地刻画了信念与意图的本质与内在联系,可作为Agent形式 化研究的逻辑工具. 相似文献
16.
17.
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. To integrate
interactive provers with automatic ones, one must translate higher-order formulas to first-order form. The translation should
ideally be both sound and practical. We have investigated several methods of translating function applications, types, and
λ-abstractions. Omitting some type information improves the success rate but can be unsound, so the interactive prover must
verify the proofs. This paper presents experimental data that compares the translations in respect of their success rates
for three automatic provers. 相似文献
18.
Qingliang CHEN Kaile SU Abdul SATTAR Xiangyu LUO Aixiang CHEN 《Frontiers of Computer Science》2016,10(2):233-245
Coalition logic (CL) enables us to model the strategic abilities and specify what a group of agents can achieve whatever the other agents do. However, some rational mental attitudes of the agents are beyond the scope of CL such as the prestigious beliefs, desires and intentions (BDI) which is an interesting and useful epistemic notion and has spawned substantial amount of studies in multi-agent systems. In this paper, we introduce a first-order coalition BDI (FCBDI) logic for multi-agent systems, which provides a semantic glue that allows the formal embedding and interaction of BDI, coalition and temporal operators in a first-order language. We further introduce a semantic model based on the interpreted system model and present an axiomatic system that is proved sound and complete with respect to the semantics. Finally, it is shown that the computational complexity of its model checking in finite structures is PSPACE-complete. 相似文献
19.
Robert Saxon Milnikel 《Annals of Mathematics and Artificial Intelligence》2005,44(1-2):1-34
Sequent calculi for skeptical consequence in predicate default logic, predicate stable model logic programming, and infinite autoepistemic theories are presented and proved sound and complete. While skeptical consequence is decidable in the finite propositional case of all three formalisms, the move to predicate or infinite theories increases the complexity of skeptical reasoning to being 11-complete. This implies the need for sequent rules with countably many premises, and such rules are employed.
AMS subject classification 03B42, 68N17, 68T27This paper grew directly out of the authors dissertation, written under the direction of Anil Nerode. 相似文献
20.
In this paper we introduce Dynamic Epistemic Logic, which is alogic for reasoning about information change in a multi-agent system. Theinformation structures we use are based on non-well-founded sets, and canbe conceived as bisimulation classes of Kripke models. On these structures,we define a notion of information change that is inspired by UpdateSemantics (Veltman, 1996). We give a sound and complete axiomatization ofthe resulting logic, and we discuss applications to the puzzle of the dirtychildren, and to knowledge programs. 相似文献