Demo Data from EDBT 2026 / reviewers in the wild / expert
Terrence C. Poon
dblp:46/1839
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Knowledge representation and reasoning · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Services computing and microservices · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning
logic programming |
0.0 | 1 | 2003 | SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions · WWW 2003 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
ontology |
0.0 | 1 | 2003 | SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions · WWW 2003 |
Services computing and microservices › web services
semantic web services |
0.0 | 1 | 2003 | SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions · WWW 2003 |
Services computing and microservices
web services |
0.0 | 1 | 2003 | SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions · WWW 2003 |
Methods — techniques the papers use, named apart from their topics
process knowledge modeling · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptionsabstractSweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial automation and modularity. It builds upon the situated courteous logic programs knowledge representation in RuleML, the emerging standard for Semantic Web XML rules. Here, we newly extend the SweetDeal approach by also incorporating process knowledge descriptions whose ontologies are represented in DAML+OIL (emerging standard for Semantic Web ontologies) thereby enabling more complex contracts with behavioral provisions, especially for handling exception conditions (e.g., late delivery or non-payment) that might arise during the execution of the contract. This provides a foundation for representing and automating deals about services -- in particular, about Web Services, so as to help search, select, and compose them. Our system is also the first to combine emerging Semantic Web standards for knowledge representation of rules (RuleML) with ontologies (DAML+OIL) for a practical e-business application domain, and further to do so with process knowledge. This also newly fleshes out the evolving concept of Semantic Web Services. A prototype (soon public) is running. Benjamin N. Grosof, Terrence C. Poon |
WWW | 2 |