Results 241 to 250 of about 220,610 (290)
Some of the next articles are maybe not open access.
Modeling Semantics of Business Rules
2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference, 2007Organizations are showing growing interest in paradigms where business models and services compatibility is adaptively tested, e.g. by applying automatic systems to check business rules consistency. In this paper, we build on the original proposal by OMG of using first-order logics for representing business vocabularies and propose an approach based on
P. Ceravolo, C. Fugazza, M. Leida
openaire +2 more sources
Converting Service Rules to Semantic Rules
2016 IEEE International Conference on Services Computing (SCC), 2016Inspired by service computing principles, in cloud manufacturing, manufacturers encapsulate their resources into consumable services that can be looked up and accessed over the Internet. Manufacturing ontologies are used to store the service information. Manufacturers use service rules to control how their resources can be accessed.
Xinfeng Ye, Ping Zhao
openaire +1 more source
Semantics oriented association rules
2002 IEEE World Congress on Computational Intelligence. 2002 IEEE International Conference on Fuzzy Systems. FUZZ-IEEE'02. Proceedings (Cat. No.02CH37291), 2003It is well known that relational theory carries very little semantic. To mine deeper semantics, additional modeling is necessary. In fact, some "pure" association rules are found to exist even in randomly generated data. We consider a relational database in which every attribute value has some additional information, such as price, fuzzy degree ...
E. Louie, T.Y. Lin
openaire +1 more source
Deriving Proof Rules from Continuation Semantics
Formal Aspects of Computing, 1999Abstract. We claim that a continuation style semantics of a programming language can provide a starting point for constructing its proof system. The basic idea is to see weakest preconditions as a particular instance of continuation style semantics, hence to interpret correctness assertions (e.g. Hoare triples { p
AUDEBAUD P., ZUCCA, ELENA
openaire +2 more sources
Semantics preserving transformation rules for Prolog
ACM SIGPLAN Notices, 1991The application of the transformational methodology to the area of logic programming is based on theoretical results which show that the Unfold/Fold transformation rules preserve both the least Herbrand model semantics and the set of answer substitutions semantics of logic programs [Tamaki-Sato 84, Kawamura-Kanamori 88].
Proietti, M., Pettorossi, A.
openaire +2 more sources
Automated Negotiation Using Semantic Rules
2014 IEEE International Conference on Services Computing, 2014With the extensive adaptation of Web service based applications in dynamic businesses applications including on demand computing, highly configurable virtual solutions and cloud computing based systems demand automated tools for composing and managing these services in composite systems.
Khayyam Hashmi +5 more
openaire +1 more source
The semantics of Hoare's Iteration Rule
Studia Logica, 1982zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A Fix-Point Semantics for Rule-Base Anomalies
International Journal of Cognitive Informatics and Natural Intelligence, 2005A crucial component of an intelligent system is its knowledge base (KB) that contains knowledge about a problem domain. KB development involves domain analysis, context space definition, ontological specification, and knowledge acquisition, codification, and verification. KB anomalies can affect the correctness and performance of an intelligent system.
openaire +1 more source
Valuational semantics of rule derivability
Journal of Philosophical Logic, 1996Syntactic Concepts. We work with an arbitrary but fixed sentential language \(L\), for which sequents are pairs \(\langle\Gamma,A \rangle\) with \(\Gamma \subseteq L\), \(A\in L\). An \(n\)-premiss rule \(\rho\) is an \((n+1)\)-ary relation on the set of sequents.
openaire +2 more sources
1996
Abstract As I have tried to show (see in particular Chapter 5), a word’s syntactic behaviour reflects, and depends on, its meaning. Thus, it is no accident that one can ask, beg,or applyFOR something, but not order, demand,or commandFOR something; or that one can both orderand asksomeone TO DO something, but not demandor applysomeone TO ...
openaire +1 more source
Abstract As I have tried to show (see in particular Chapter 5), a word’s syntactic behaviour reflects, and depends on, its meaning. Thus, it is no accident that one can ask, beg,or applyFOR something, but not order, demand,or commandFOR something; or that one can both orderand asksomeone TO DO something, but not demandor applysomeone TO ...
openaire +1 more source