共查询到20条相似文献,搜索用时 15 毫秒
1.
经典命题演算形式系统(CPC)中的公式只是一些形式符号,这些形式符号的意义是由具体的解释给出的.概率逻辑是在标准概率空间上建立的一种逻辑体系,是CPC的随机事件语义,对联结词的解释就是集合运算,对形式公式的解释就是事件函数,对逻辑蕴涵和逻辑等价的解释就是事件(集合)包含和事件相等=.由于不存在处处适用的真值函数(算子),概率逻辑不能在CPC内实现概率演算,但可在CPC内实现事件演算,CPC完全适用于概率命题演算. 相似文献
2.
Franco Montagna 《Journal of Logic, Language and Information》2000,9(1):91-124
We investigate the variety corresponding to a logic (introduced in Esteva and Godo, 1998, and called there), which is the combination of ukasiewicz Logic and Product Logic, and in which Gödel Logic is interpretable. We present an alternative (and slightly simpler) axiomatization of such variety. We also investigate the variety, called the variety of
algebras, corresponding to the logic obtained from by the adding of a constant and of a defining axiom for one half. We also connect
algebras with structures, called f-semifields, arising from the theory of lattice-ordered rings, and prove that every
algebra
can be regarded as a structure whose domain is the interval [0, 1] of an f-semifield
, and whose operations are the truncations of the operations of
to [0, 1]. We prove that such a structure
is uniquely determined by
up to isomorphism, and we establish an equivalence between the category of
algebras and that of f-semifields. 相似文献
3.
Davide Bresolin Angelo Montanari Guido Sciavicco 《Journal of Automated Reasoning》2007,38(1-3):173-199
Propositional interval temporal logics are quite expressive temporal logics that allow one to naturally express statements
that refer to time intervals. Unfortunately, most such logics turn out to be (highly) undecidable. In order to get decidability,
severe syntactic or semantic restrictions have been imposed to interval-based temporal logics to reduce them to point-based
ones. The problem of identifying expressive enough, yet decidable, new interval logics or fragments of existing ones that
are genuinely interval-based is still largely unexplored. In this paper, we focus our attention on interval logics of temporal
neighborhood. We address the decision problem for the future fragment of Neighborhood Logic (Right Propositional Neighborhood
Logic, RPNL for short), and we positively solve it by showing that the satisfiability problem for RPNL over natural numbers
is NEXPTIME-complete. Then, we develop a sound and complete tableau-based decision procedure, and we prove its optimality. 相似文献
4.
Michael Mendler 《Formal Methods in System Design》2000,17(1):5-37
Classical logic has so far been the logic of choice in formal hardware verification. This paper proposes the application of intuitionistic logic to the timing analysis of digital circuits. The intuitionistic setting serves two purposes. The model-theoretic properties are exploited to handle the second-order nature of bounded delays in a purely propositional setting without need to introduce explicit time and temporal operators. The proof-theoretic properties are exploited to extract quantitative timing information and to reintroduce explicit time in a convenient and systematic way.We present a natural Kripke-style semantics for intuitionistic propositional logic, as a special case of a Kripke constraint model for Propositional Lax Logic (Information and Computation, Vol. 137, No. 1, 1–33, 1997), in which validity is validity up to stabilisation, and implication comes out as boundedly gives rise to. We show that this semantics is equivalently characterised by a notion of realisability with stabilisation bounds as realisers. Following this second point of view an intensional semantics for proofs is presented which allows us effectively to compute quantitative stabilisation bounds.We discuss the application of the theory to the timing analysis of combinational circuits. To test our ideas we have implemented an experimental prototype tool and run several examples. 相似文献
5.
6.
Claes Strannegård Simon Ulfsbäcker David Hedqvist Tommy Gärling 《Journal of Logic, Language and Information》2010,19(3):283-314
We conducted a computer-based psychological experiment in which a random mix of 40 tautologies and 40 non-tautologies were
presented to the participants, who were asked to determine which ones of the formulas were tautologies. The participants were
eight university students in computer science who had received tuition in propositional logic. The formulas appeared one by
one, a time-limit of 45 s applied to each formula and no aids were allowed. For each formula we recorded the proportion of
the participants who classified the formula correctly before timeout (accuracy) and the mean response time among those participants
(latency). We propose a new proof formalism for modeling propositional reasoning with bounded cognitive resources. It models
declarative memory, visual memory, working memory, and procedural memory according to the memory model of Atkinson and Shiffrin
and reasoning processes according to the model of Newell and Simon. We also define two particular proof systems, T and NT, for showing propositional formulas to be tautologies and non-tautologies, respectively. The accuracy was found to be higher
for non-tautologies than for tautologies (p < .0001). For tautologies the correlation between latency and minimum proof length in T was .89 and for non-tautologies the correlation between latency and minimum proof length in NT was .87. 相似文献
7.
剩余模糊逻辑演算与连续三角范数是紧密相关的,三角范数是合取联结词的真值函数,三角范数的剩余是蕴涵联结词的真值函数. 在这些逻辑中,非运算都是由蕴涵和真值常量0定义的,即(→)P∶P→0-.在本文中,我们引入一种具有对合性质的强非运算联结词"~"和投影联结词"Δ",证明基于严格泛与运算模型T(x,y,h)(h∈(0.75,1))的命题演算逻辑PC(T)系统是基本严格模糊逻辑SBL;PC(T)~是基本严格模糊逻辑SBL的扩张SBL~. 相似文献
8.
针对协同问题求解、协同设计等诸多领域中存在逻辑冲突的共性问题,从二值命题逻辑理论出发,研究面向冲突的无损求解(即初始解空间获取)问题.首先,提出简单合取式的扩充和Wh-析取范式等概念,在此基础上定义初始解空间,并通过提出的有效扩充概念得到初始解空间的简化表示——最简解空间,探讨了两类解空间的关系及各自的计算方法.其次,构造生成序列来辅助公式的析取化,从泛代数的角度定义了Wh-代数;提出了指数矩阵,并籍此给出了Wh-代数的等价表现形式,通过引入扩展指数矩阵构造出扩展Wh-代数.最后证明了扩展Wh-代数中的展开定理和逻辑简化定理,给出基于有效扩充的直接无损求解算法,并与提出的其他相关算法进行了对比,结果表明该算法较为理想.该研究对于协同问题求解等领域有着重要的推动作用. 相似文献
9.
10.
The increasing complexity of business processes in the era of e-business has heightened the need for workflow verification tools. However, workflow verification remains an open and challenging research area. As an indication, most of commercial workflow management systems do not yet provide workflow designers with formal workflow verification tools. We propose a logic-based verification method that is based on a well-known formalism, i.e., propositional logic. Our logic-based workflow verification approach has distinct advantages such as its rigorous yet simplistic logical formalism and its ability to handle generic activity-based process models. In this paper, we present the theoretical framework for applying propositional logic to workflow verification and demonstrate that logic-based workflow verification is capable of detecting process anomalies in workflow models. 相似文献
11.
本文讨论了泛与运算模型T(x,y.h)(h∈(o,0.75))的一些性质;证明了泛与运算模型T(x,y,h)(h∈(0,O.75))是一个幂零三角范数;而且泛与运算模型T(x,y.h)(h∈(0,0.75))与泛蕴涵运算模型,(x,y,h)(h∈(0,0.75))是一个伴随对;进一步证明了([0,1].∨,∧.*,→.0,1)作成一个MV-代数。给出了基于幂零泛与运算模型T(x,y,h)(h∈(0,0.75))的模糊命题演算系统PC(T),证明了此命题演算系统与Lukasiewicz逻辑命题演算系统是等价的。 相似文献
12.
在基于命题逻辑的可满足性问题(SAT)求解器和基于一阶逻辑的定理证明器上,子句集简化一直是必不可少的步骤,而其中子句消去方法在这些子句集简化方法中是非常重要的组成部分。将命题逻辑中的子句消去方法归结隐藏恒真消去方法(RHTE)和归结隐藏包含消去方法(RHSE)提升到一阶逻辑上,并且利用蕴含模归结原则(IMR)证明了这种提升方式在一阶逻辑上具有可靠性(Soundness),即依据这两种子句消去方法删除一阶逻辑公式集中的子句,并不会改变公式集的可满足性或者不可满足性。此外,将这两个方法与一阶逻辑子句消去方法锁子句消去方法(BCE)和归结包含消去方法(RSE)进行组合推广,发展得到一阶逻辑上新型子句消去方法(BC+RHS)E、(RS+RHT)E和(RHS+RHT)E,并且证明了这3种子句消去方法在一阶逻辑上的可靠性。最后,分析比较了这些子句消去方法的有效性,并且证明了这3种新型子句消去方法比组成它们的原始子句消去方法均具有更高的有效性。 相似文献
13.
14.
15.
主要研究命题逻辑公式中的冗余子句和冗余文字。针对子句集中必需的、有用的、无用的子句,分别给出了一些等价描述方法,进而讨论子句集的无冗余等价子集。另外,得到了子句集中冗余文字的判别方法,借助可满足性给出了冗余子句的一种等价条件。上述结果为命题逻辑公式的化简奠定了一些理论基础。 相似文献
16.
Francine Berman 《Theory of Computing Systems》1981,15(1):285-294
Standard and nonstandard models of Propositional Dynamic Logic differ in their interpretation of loops. In Standard models, a loop is interpreted as the Kleene closure of the interpretation of its loop body; in nonstandard (Loop Invariant) models, a loop is interpreted as a program which preserves invariant assertions over the loop body.In this paper we show that both interpretations are adequate to represent loops in PDL. We demonstrate this in two ways: First we note that Standard and Loop Invariant models are distinct but not distinguishable within PDL. Second, we show that the class of Loop Invariant models is complete with respect to the Segerberg axiomatization of PDL. Since completeness of the class of Loop Invariant models implies completeness of the class of Standard models, Standard models are also complete with respect to this axiomatization.The research reported here was supported in part by NSF Grants MCS77-02474 and MCS80-05387. Most of the results in this paper were announced in A Completeness Technique forD-axiomatizable Semantics presented at the 11th Annual ACM Symposium on the Theory of Computing in May, 1979. 相似文献
17.
基于Graphplan的编码方式是2006年国际规划竞赛中著名的最优规划系统SATPLAN2006采用的编码方式。首先给出与编码相关的概念与性质,在基于Graphplan的编码方式的基础上,设计一种新的编码方式:基于FA的编码方式,并从理论上证明该编码方式的有效性。设计并实现对应的规划系统FA-SP,利用国际规划竞赛选用的Benchmark问题予以测试。实验结果表明,与SATPLAN2006相比,FA-SP对于所测两类规划域编码规模均有所压缩,除个别问题外求解效率都有一定程度的提高;对于顺序规划域Blocks World,编码规模平均压缩了40%,求解效率平均提高了2倍;对于并发规划域Logistics,带有小于5%的框架公理的FA编码规模平均压缩了75%,求解效率也有不同程度的提高。 相似文献
18.
19.
现有模型检测工具的形式化规范语言,如计算树逻辑(computation tree logic,简称CTL)和线性时序逻辑(linear temporal logic,简称LTL)等的描述能力不足,无法验证ω正则性质.提出了一个命题投影时序逻辑(propositional projection temporal logic,简称PPTL)符号模型检测工具——PLSMC(PPTL symbolic model checker)的设计与实现过程.该工具基于著名的符号模型检测系统NuSMV,实现了PPTL的符号模型检测算法.PLSMC的规范语言PPTL具有完全正则表达能力,这使得定性性质和定量性质均可被验证.此外,PLSMC可以有效地缓解模型检测工具中容易发生的状态空间爆炸问题.最后,利用PLSMC对铁路公路交叉道口护栏控制系统的安全性质和周期性性质进行验证.实验结果表明,PPTL符号模型检测工具扩充了NuSMV系统的验证能力,使得时间敏感、并发性和周期性等实时性质可以被描述和验证. 相似文献
20.
Extended IF 逻辑是一阶逻辑的扩张,其主要特点是可表达量词间的相互依赖和独立关系,但其命题部分至今没有得到公理化.基于Cirquent 演算方法,给出了一个关于Cirquent 语义(命题水平)可靠完备的形式系统.该系统能够很好地解释和表达命题联结词间的相互依赖和独立关系,从而使Extended IF 逻辑在命题水平得到了真正意义上的公理化. 相似文献