Sciweavers

345 search results - page 51 / 69
» Kripke models for classical logic
Sort
View
100
Voted
SAC
2003
ACM
15 years 5 months ago
Semantic Matchmaking in a P-2-P Electronic Marketplace
Matchmaking is the problem of matching offers and requests, such as supply and demand in a marketplace, services and customers in a service agency, etc., where both partners are ...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
90
Voted
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
15 years 4 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
117
Voted
FCT
2005
Springer
15 years 6 months ago
A Self-dependency Constraint in the Simply Typed Lambda Calculus
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
Aleksy Schubert
114
Voted
ICFEM
2009
Springer
14 years 10 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
110
Voted
ICEIS
2005
IEEE
15 years 6 months ago
Conditions for Interoperability
Abstract: Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases nee...
B. Nick Rossiter, Michael A. Heather