Computing Sufficient and Necessary Conditions in CTL: A Forgetting Approach

Article Computer Science, Information Systems

Uncertain knowledge representation and reasoning with linguistic belief structures

Mohammad Reza Rajati et al.

Summary: This paper extends the concept of Dempster-Shafer Belief Structures to Linguistic Belief Structures, and explores methods for deriving probabilities and performing operations on these structures.

INFORMATION SCIENCES (2022)

Add to Collection

Article Computer Science, Information Systems

Ontology verification testing using lexico-syntactic patterns

Alba Fernandez-Izquierdo et al.

Summary: Ontology verification is an essential activity in ontology development, ensuring that ontologies are built correctly in compliance with their specifications. This paper proposes a method using lexico-syntactic patterns and ontologies to define testing activities and provides an online tool for executing tests. User evaluation showed that tools utilizing testing languages had better results in reducing errors compared to those that do not.

INFORMATION SCIENCES (2022)

Add to Collection

Article Computer Science, Information Systems

A fuzzy semantic representation and reasoning model for multiple associative predicates in knowledge graph

Pu Li et al.

Summary: This paper presents a new semantic representation and reasoning model for multiple associative predicates based on fuzzy theory to address the issue of ineffective representation of fuzzy semantic information in classical knowledge graphs. Experimental results demonstrate that the proposed method can discover more implicit valid knowledge with fuzzy semantics and is consistent with human judgments.

INFORMATION SCIENCES (2022)

Add to Collection

Article Computer Science, Software Engineering

Weighted Programming A Programming Paradigm for Specifying Mathematical Models

Kevin Batz et al.

Summary: Weighted programming is a programming paradigm for specifying mathematical models with features like nondeterministic branching and weighting execution traces. It can be used beyond probability distributions and allows for reasoning about mathematical models specified by weighted programs. Case studies show its application in modeling and solving optimization problems.

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL (2022)

Add to Collection

Article Computer Science, Software Engineering

Loop invariance with break and continue

Wei Chen

Summary: This paper presents a formal approach to program derivation using break and continue statements within a loop, emphasizing the introduction of these statements into the loop to derive program correctness. Several case studies show that using jump statements can lead to simpler and more comprehensible program derivation.

SCIENCE OF COMPUTER PROGRAMMING (2021)

Add to Collection

Proceedings Paper Computer Science, Artificial Intelligence

Semantic Forgetting in Expressive Description Logics

Mostafa Sakr et al.

Summary: Forgetting is an important ontology extraction technology, and a semantic forgetting method for ALC ontologies has been proposed in this study. The method performs well on large-scale ontologies, with the number of helper symbols decreasing as the number of forgetting symbols increases. Good performance has been achieved compared to the forgetting tool Fame(Q), while more semantic content is preserved.

FRONTIERS OF COMBINING SYSTEMS (FROCOS 2021) (2021)

Add to Collection

Article Computer Science, Theory & Methods