Sciweavers

276 search results - page 4 / 56
» Representing Transition Systems by Logic Programs
Sort
View
DLOG
2006
13 years 9 months ago
Model checking the basic modalities of CTL with Description Logic
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
14 years 1 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
EUSFLAT
2009
118views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Operational Semantics for a Fuzzy Logic Programming System with Defaults and Constructive Answers
In this paper we present the operational semantics of RFuzzy, a fuzzy Logic Programming framework that represents thruth values using real numbers from the unit interval. RFuzzy pr...
Hannes Strass, Susana Muñoz-Hernánde...
POPL
2012
ACM
12 years 3 months ago
The marriage of bisimulations and Kripke logical relations
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Va...
WWW
2003
ACM
14 years 8 months ago
SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
Benjamin N. Grosof, Terrence C. Poon