3 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.AI2020
On Sufficient and Necessary Conditions in Bounded CTL: A Forgetting Approach
Renyan Feng, Erman Acar, Stefan Schlobach +2
Computation Tree Logic (CTL) is one of the central formalisms in formal verification. As a specification language, it is used to express a property that the system at hand is expec…
cs.AI2015★ 3 cited
On Forgetting in Tractable Propositional Fragments
Yisong Wang
Distilling from a knowledge base only the part that is relevant to a subset of alphabet, which is recognized as forgetting, has attracted extensive interests in AI community. In st…
cs.AI2011★ 2 cited
Embedding Description Logic Programs into Default Logic
Yisong Wang, Jia-Huai You, Li Yan Yuan +2
Description logic programs (dl-programs) under the answer set semantics formulated by Eiter {\em et al.} have been considered as a prominent formalism for integrating rules and ont…