نتایج جستجو برای: compositional rule of inference crialgorithm

تعداد نتایج: 21180595  

2012
Qiusong Yang Edmund M. Clarke Anvesh Komuravelli Mingshu Li

Compositional verification provides a way for deducing properties of a complete program from properties of its constituents. In particular, the assume-guarantee style of reasoning splits a specification into assumptions and guarantees according to a given inference rule and the generation of assumptions through machine learning makes the automatic reasoning possible. However, existing works are...

Journal: :Expert Syst. Appl. 2015
Chee Kau Lim Chee Seng Chan

Keywords: Fuzzy relations BK subproduct Inference engine Interval-valued fuzzy sets Fuzzy sets and systems Membership functions a b s t r a c t The study of fuzzy relations forms an important fundamental of fuzzy reasoning. Among all, the research on compositional fuzzy relations by Bandler and Kohout, or the Bandler–Kohout (BK) subproduct gained remarkable success in developing inference engin...

Journal: :Proceedings of the ACM on Programming Languages 2018

1994
Lin Padgham Patrick Lambrix

There is a growing recognition that part-whole hierarchies are a very general form of representation, widely used by humans in commonsense reasoning. This paper develops a terminological logic, and related inference mechanisms for representing and reasoning about composite concepts and individuals. A basic terminological logic language is extended with constructs for describing composite concep...

2006
Xiaofeng Wang Jianbo Ou Xiaofeng Meng Yan Chen

Abox inference is an important part in OWL data management. When involving large scale of instance data, it can not be supported by existing inference engines. In this paper, we propose efficient Abox inference algorithms for large scale OWL-Lite data. The algorithms can be divided into two categories: initial inference and incremental inference. Initial inference is used in situation where onl...

2014
MOHSEN VAKILIAN Vikram S. Adve Brian P. Bailey

Software rapidly evolves. A refactoring is a code change that preserves the behavior of the program. There has been much interest in automation to make refactoring more efficient and reliable. Although modern Integrated Development Environments (IDEs) provide many automated refactorings, studies suggest that programmers underuse automated refactorings. Based on our studies of programmers’ refac...

Journal: :International Journal of Approximate Reasoning 1988

2012
Naomi Zeichner Jonathan Berant Ido Dagan

The importance of inference rules to semantic applications has long been recognized and extensive work has been carried out to automatically acquire inference-rule resources. However, evaluating such resources has turned out to be a non-trivial task, slowing progress in the field. In this paper, we suggest a framework for evaluating inference-rule resources. Our framework simplifies a previousl...

2005
Devin S. Johnson Jennifer A. Hoeting LeRoy Poff

We develop a model to relate a multivariate compositional response to a number of covariates. We propose a new graphical model, called the Random Effects Discrete Regression (REDR) model, which allows for examination of the complex conditional relationships between a set of covariates and multiple discrete response variables. Our approach offers a number of advantages over previous approaches a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید