Sciweavers

3081 search results - page 550 / 617
» A Formal Ontology of Properties
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 1 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
DLOG
1996
15 years 1 months ago
Resolving Semantic Heterogeneity in Databases with a Terminological Model: Correspondence Refinement
The success of schema integration in multidatabase systems relies heavily on the determination of complete and refined correspondence relationships between them. So, the candidate...
Ounissa Larab, Aïcha-Nabila Benharkat
SLP
1994
77views more  SLP 1994»
15 years 1 months ago
Modal Event Calculus
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
LFP
1992
153views more  LFP 1992»
15 years 1 months ago
Reasoning About Programs in Continuation-Passing Style
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
Amr Sabry, Matthias Felleisen
ATAL
2010
Springer
15 years 1 months ago
Reasoning about strategies of multi-agent programs
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
Mehdi Dastani, Wojciech Jamroga