{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:57:37Z","timestamp":1750309057252,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSOFT Softw. Eng. Notes"],"published-print":{"date-parts":[[2005,9]]},"abstract":"<jats:p>We take the position that for any goal achievable on the Semantic Web, there will be a \"best\" system of Web-dwelling software agents to realize that goal, and that such a system may be discovered effectively. The process of determining the \"best\" agent system may be overseen by a distinguished Manager Agent. But with realistic time and space constraints, and the dynamic nature of the Semantic Web, finding an approximating system may be acceptable. The approximation then may be adapted iteratively, to approach the ideal. We show that very practical researchers have looked at software agents and Semantic Web problems in a similar way, determining approximating sub-optimal systems and subsequently adapting them. Their applied research confirms that theory provides a good foundation for practice.<\/jats:p>","DOI":"10.1145\/1095430.1095442","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T19:28:32Z","timestamp":1131391712000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Some agent theory for the semantic web"],"prefix":"10.1145","volume":"30","author":[{"given":"Leona F.","family":"Fass","sequence":"first","affiliation":[{"name":"Carmel CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/544741.544768"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0501-34"},{"key":"e_1_2_1_3_1","unstructured":"DeLoach S. A. and E. Matson (2004): \"An Organizational Model for Designing Adaptive Multiagent Systems\" in {4} pp. 66--73.  DeLoach S. A. and E. Matson (2004): \"An Organizational Model for Designing Adaptive Multiagent Systems\" in {4} pp. 66--73."},{"volume-title":"San Jose CA","year":"2004","author":"Dignum V.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","first-page":"113","volume-title":"Stanford University","author":"Fass L. F.","year":"2001"},{"key":"e_1_2_1_6_1","unstructured":"Fass L. F. (2002): \"Can We Improve Web Access in the Real World?\" appears as Statement of Interest at URL:http:\/\/projects.teknowledge.com\/AAAI-2002\/Fass.html and in {16} pp. xv-xvi.  Fass L. F. (2002): \"Can We Improve Web Access in the Real World?\" appears as Statement of Interest at URL:http:\/\/projects.teknowledge.com\/AAAI-2002\/Fass.html and in {16} pp. xv-xvi."},{"key":"e_1_2_1_7_1","unstructured":"Fass L. F. (2004): \"An Automata-Theoretic View of Agent Coalitions\" in {20} pp. 18--21.  Fass L. F. (2004): \"An Automata-Theoretic View of Agent Coalitions\" in {20} pp. 18--21."},{"key":"e_1_2_1_8_1","first-page":"1433","volume-title":"Proceedings of the Joint Conference on Information Sciences\/Workshop on Web Intelligence and Security, Salt Lake City UT","author":"Fass L. F.","year":"2005"},{"key":"e_1_2_1_9_1","unstructured":"Garrido L. R. Brena and K. Sycara (2002): \"On Measuring the Usefulness of Modeling in a Competitive and Cooperative Environment\" in {24} pp. 48--54.  Garrido L. R. Brena and K. Sycara (2002): \"On Measuring the Usefulness of Modeling in a Competitive and Cooperative Environment\" in {24} pp. 48--54."},{"key":"e_1_2_1_10_1","unstructured":"Guestrin C. M. Lagoudakis and R. Parr (2002): \"Coordinated Reinforcement Learning\" in {24}: pp. 98--105.   Guestrin C. M. Lagoudakis and R. Parr (2002): \"Coordinated Reinforcement Learning\" in {24}: pp. 98--105."},{"key":"e_1_2_1_11_1","unstructured":"Guestrin C. S. Venkataraman and D. Koller (2002): \"Context Specific Multiagent Coordination and Planning with Factored MDPs\" in {24} pp. 17--24.   Guestrin C. S. Venkataraman and D. Koller (2002): \"Context Specific Multiagent Coordination and Planning with Factored MDPs\" in {24} pp. 17--24."},{"key":"e_1_2_1_12_1","unstructured":"Heflin J. and H. Munoz-Avila (2002): \"LCW-Based Agent Planning for the Semantic Web\" in {16} pp. 63--70.  Heflin J. and H. Munoz-Avila (2002): \"LCW-Based Agent Planning for the Semantic Web\" in {16} pp. 63--70."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/5254.920597"},{"key":"e_1_2_1_14_1","unstructured":"Li X. and L-K Soh (2004): \"Investigating Reinforcement Learning in Multiagent Coalition Formation\" in {20} pp. 22--28  Li X. and L-K Soh (2004): \"Investigating Reinforcement Learning in Multiagent Coalition Formation\" in {20} pp. 22--28"},{"volume-title":"Invited Symposium Talk, AAAI Spring Symposium on Logic-Based Program Synthesis: State of the Art and Future Trends","year":"2002","author":"McIlraith S. A.","key":"e_1_2_1_15_1"},{"volume-title":"Edmonton AB","year":"2002","author":"Pease A.","key":"e_1_2_1_16_1"},{"key":"e_1_2_1_17_1","unstructured":"Riley P. and M. Veloso (2004):\"An Agent Coaching Agents\" in {18} pp. 61--62  Riley P. and M. Veloso (2004):\"An Agent Coaching Agents\" in {18} pp. 61--62"},{"volume-title":"San Jose CA","year":"2004","author":"Rosenstein M.","key":"e_1_2_1_18_1"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Sen S. and P. P. Kar (2002): \"Sharing a Concept\" in {24} pp. 55--60.  Sen S. and P. P. Kar (2002): \"Sharing a Concept\" in {24} pp. 55--60.","DOI":"10.1097\/01.COT.0000315334.70934.99"},{"volume-title":"San Jose CA","year":"2004","author":"Soh K","key":"e_1_2_1_20_1"},{"key":"e_1_2_1_21_1","unstructured":"Soh L-K and C. Tsatsoulis (2002): \"Learning to Form Negotiation Coalitions in a Multiagent System\" in {24} pp. 106--112.  Soh L-K and C. Tsatsoulis (2002): \"Learning to Form Negotiation Coalitions in a Multiagent System\" in {24} pp. 106--112."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/5254.988491"},{"key":"e_1_2_1_23_1","first-page":"83","author":"Steels L.","year":"2002","journal-title":"Language Games for Emergent Semantics\" in {22}"},{"volume-title":"Stanford University","year":"2002","author":"Tumer K.","key":"e_1_2_1_24_1"},{"volume-title":"Invited Symposium Talk, abstracted in Logic-Based Program Synthesis: State of the Art and Future Trends, Papers from the AAAI Spring Symposium","year":"2002","author":"Waldinger R.","key":"e_1_2_1_25_1"}],"container-title":["ACM SIGSOFT Software Engineering Notes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095430.1095442","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1095430.1095442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:29:47Z","timestamp":1750285787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095430.1095442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["10.1145\/1095430.1095442"],"URL":"https:\/\/doi.org\/10.1145\/1095430.1095442","relation":{},"ISSN":["0163-5948"],"issn-type":[{"type":"print","value":"0163-5948"}],"subject":[],"published":{"date-parts":[[2005,9]]},"assertion":[{"value":"2005-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}