Results 241 to 250 of about 16,476,009 (293)

Approximate reasoning with time

Fuzzy Sets and Systems, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Swapan Raha, Kumar Sankar Ray
openaire   +1 more source

Real-time reasoning with PROLOG

Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems - SIGSMALL '90, 1990
In this paper, we present a description of a Prolog implementation of a system (RTR) for “real-time reasoning”, similar to those discussed by Perlis (see [3] and [6]). The reasoning to be performed by the system is “real-time” in two different senses. First, reasoning is considered to be a continuing process rather than an isolated calculation of the ...
Chunsik Yi, Steven Graham
openaire   +1 more source

Simple Reasoning with Time-Dependent Propositions

Logic Journal of IGPL, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maroua Bouzid, Peter B. Ladkin
openaire   +1 more source

A proposal to reduce cumulative reasoning time in hypothetical reasoning

Systems and Computers in Japan, 1999
Considered in this paper is a method to reduce cumulative execution time in hypothetical reasoning using inference-path network. Logic-based hypothetical reasoning provides an efficient framework that can be applied to such areas as diagnostics and design, but in so doing, the reasoning speed may prove insufficient. This problem seems to be solvable by
Hideaki Nobata, Haruhiko Kimura, Sadaki Hirose   +2 more
openaire   +2 more sources

Reasoning with Time and Data Abstractions

2016
In this thesis, we address the problem of verifying the functional correctness of concurrent programs, with emphasis on fine-grained concurrent data structures. Reasoning about such programs is challenging since data can be concurrently accessed by multiple threads: the reasoning must account for the interference between threads, which is often subtle.
openaire   +3 more sources

Reasoning with maximal time intervals

2005
The ability to deal with partial knowledge is particularly important in a temporal domain. We describe a temporal language that accounts for incompletely specified temporal information about propositions. Temporal terms in the language denote time instants and inequality constraints are used to keep incomplete information about their order.
Cristina Ribeiro 0001, António Porto
openaire   +1 more source

On reasoning with the global time assumption

ACM Letters on Programming Languages and Systems, 1992
Concurrency in distributed systems is usually modeled by a nondeterministic interleaving of atomic events. The consequences of this interleaving (or global time) assumption on the specifications and proofs of distributed programs are examined in this paper.
openaire   +2 more sources