activity
20012019
most citedA Logical Framework for Convergent Infinite Computations

3 citations · 4 across the 6 of their papers we have counts for

collaborators

6 papers

cs.AI2019

A Logical Model for Supporting Social Commonsense Knowledge Acquisition

Zhenzhen Gu, Cungen Cao, Ya Wang +1

To make machine exhibit human-like abilities in the domains like robotics and conversation, social commonsense knowledge (SCK), i.e., common sense about social contexts and social…

cs.LO2017

Completeness of Hoare Logic over Nonstandard Models

Zhaowei Xu, Yuefei Sui, Wenhui Zhang

The nonstandard approach to program semantics has successfully resolved the completeness problem of Floyd-Hoare logic. The known versions of nonstandard semantics, the Hungary sema…

cs.LO2017★ 1 cited

On Completeness Results of Hoare Logic Relative to the Standard Model

Zhaowei Xu, Wenhui Zhang, Yuefei Sui

The general completeness problem of Hoare logic relative to the standard model of Peano arithmetic has been studied by Cook, and it allows for the use of arbitrary arithmetical…

cs.AI2002

The Prioritized Inductive Logic Programs

Shilong Ma, Yuefei Sui, Ke Xu

The limit behavior of inductive logic programs has not been explored, but when considering incremental or online inductive learning algorithms which usually run ongoingly, such beh…

cs.LO2001★ 3 cited

A Logical Framework for Convergent Infinite Computations

Wei Li, Shilong Ma, Yuefei Sui +1

Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computat…

cs.LO2001

The Limits of Horn Logic Programs

Shilong Ma, Yuefei Sui, Ke Xu

Given a sequence of Horn logic programs, the limit of is the set of the clauses such that every clause in belongs to almost every and every clause…