A clausal resolution method for branching-time logic ECTL

Bolotov, Alexander; Basukoski, Artie

doi:10.1109/time.2004.1314431

Cited by 3 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has been proved that P R i in [44], and then there is T iþ1 ¼ T i [ K 8t :l , where K 8t :l is a set of SNF g ctl clauses obtained from R i using the transformation rules. Therefore, for all M 1 ; s 1 ð Þ2 Mod T i ð Þ, there is a M 2 ; s 2 ð Þ2 Mod T iþ1 :l is a fresh atom uniquely associated with clause Q !…”

Section: Then We Havementioning

confidence: 99%

Computing Sufficient and Necessary Conditions in CTL: A Forgetting Approach

Feng

Acar²,

Wang³

et al. 2022

Information Sciences

View full text Add to dashboard Cite

Section: Then We Havementioning

confidence: 99%

Computing Sufficient and Necessary Conditions in CTL: A Forgetting Approach

Feng

Acar²,

Wang³

et al. 2022

Information Sciences

View full text Add to dashboard Cite

“…The advantage of the Fractal framework is that it defines the structure of the components, gives a basic classification of components, and has the mathematical foundations e.g., the Nell calculus [7]. The Fractal specification defines the basic (non-functional) controls which should be defined especially to enable dynamic reconfiguration of components, and a number of [10], [11]. Furthermore, a clausal resolution over the set of SNFCTL clauses has been defined [9], [10] and recently the search strategies for this method were presented in [12].…”

Section: Introductionmentioning

confidence: 99%

Specilfication and Verilfication of Rleconfiguration Protocols in Grid Comnponent Systemns

Basso

Boltov

Basukoski

et al. 2006

2006 3rd International IEEE Conference Intelligent Systems

View full text Add to dashboard Cite

In this work we present an approach for the formal specification and verification of the reconfiguration protocols in Grid component systems. We consider Fractal, a modular and extensible component model. As a specification tool we invoke a specific temporal language, separated clausal normal form, which has been shown to be capable of expressing any ECTL+ expression thus, we are able to express the complex fairness properties of a component system. The structure of the normal enables us to directly apply the deductive verification technique, temporal resolution defined in the framework of branching-time temporal logic.

show abstract

A sound and complete fuzzy temporal constraint logic

Cárdenas-Viedma

2006

IEEE Trans. Syst., Man, Cybern. B

View full text Add to dashboard Cite

In this work, we define an extended fuzzy temporal constraint logic (EFTCL) based on possibilistic logic. EFTCL allows us to handle fuzzy temporal constraints between temporal variables and, therefore, enables us to express interrelated events through fuzzy temporal constraints. EFTCL is compatible with a theoretical temporal reasoning model: the fuzzy temporal constraint networks (FTCN). The syntax, the semantics and the deduction and refutation theorems for EFTCL are similar to those defined for the sound and noncomplete fuzzy temporal constraint logic (FTCL). In this paper, a resolution principle for performing inferences which take these constraints into account is proposed for EFTCL. Moreover, we prove the soundness and the completeness of the refutation by resolution in EFTCL.

show abstract

A clausal resolution method for branching-time logic ECTL

Abstract: Abstract

Cited by 3 publications

References 15 publications

Computing Sufficient and Necessary Conditions in CTL: A Forgetting Approach

Computing Sufficient and Necessary Conditions in CTL: A Forgetting Approach

Specilfication and Verilfication of Rleconfiguration Protocols in Grid Comnponent Systemns

A sound and complete fuzzy temporal constraint logic

Contact Info

Product

Resources

About