From the President
暂无分享,去创建一个
[1] P. Wegner. Programming Languages, Information Structures, and Machine Organization. , 1968 .
[2] Bernhard Nebel,et al. Extending Planning Graphs to an ADL Subset , 1997, ECP.
[3] Marek J. Sergot,et al. A logic-based calculus of events , 1989, New Generation Computing.
[4] Gert Smolka,et al. Attributive Concept Descriptions with Complements , 1991, Artif. Intell..
[5] Håkan L. S. Younes,et al. On the Role of Ground Actions in Refinement Planning , 2002, AIPS.
[6] Roy Fielding,et al. Architectural Styles and the Design of Network-based Software Architectures"; Doctoral dissertation , 2000 .
[7] Bart Selman,et al. Encoding Plans in Propositional Logic , 1996, KR.
[8] David E. Wilkins,et al. Practical planning - extending the classical AI planning paradigm , 1989, Morgan Kaufmann series in representation and reasoning.
[9] Blai Bonet,et al. Heuristic Search Planner 2.0 , 2001, AI Mag..
[10] Blai Bonet,et al. Planning as Heuristic Search: New Results , 1999, ECP.
[11] Bijan Parsia,et al. Planning for Semantic Web Services , 2004, SWS@ISWC.
[12] Craig A. Knoblock,et al. Web service composition as planning , 2003 .
[13] Paolo Traverso,et al. Automatic OBDD-Based Generation of Universal Plans in Non-Deterministic Domains , 1998, AAAI/IAAI.
[14] Georg Gottlob,et al. Visual Web Information Extraction with Lixto , 2001, VLDB.
[15] Patrick Doherty,et al. TALplanner: A temporal logic based forward chaining planner , 2001, Annals of Mathematics and Artificial Intelligence.
[16] Erhard Rahm,et al. A survey of approaches to automatic schema matching , 2001, The VLDB Journal.
[17] Volker Haarslev,et al. Description of the RACER System and its Applications , 2001, Description Logics.
[18] Blai Bonet,et al. Planning as heuristic search , 2001, Artif. Intell..
[19] Drew McDermott,et al. A Heuristic Estimator for Means-Ends Analysis in Planning , 1996, AIPS.
[20] Edsger W. Dijkstra,et al. Notes on structured programming , 1970 .
[21] Daniel S. Weld,et al. UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.
[22] Murray Shanahan,et al. An abductive event calculus planner , 2000, J. Log. Program..
[23] Sheila A. McIlraith,et al. Simulation, verification and automated composition of web services , 2002, WWW.
[24] Edwin P. D. Pednault,et al. ADL and the State-Transition Model of Action , 1994, J. Log. Comput..
[25] Sheila A. McIlraith,et al. Adapting BPEL4WS for the Semantic Web: The Bottom-Up Approach to Web Service Interoperation , 2003, SEMWEB.
[26] Diego Calvanese,et al. e-Service Composition by Description Logics Based Reasoning , 2003, Description Logics.
[27] José M. Vidal,et al. Matchmaking of web services based on the DAML-S service model , 2003, AAMAS '03.
[28] James A. Hendler,et al. Automatic Web Services Composition Using SHOP2 , 2003, WWW.
[29] Dana S. Nau,et al. On the Complexity of Blocks-World Planning , 1992, Artif. Intell..
[30] Gary James Jason,et al. The Logic of Scientific Discovery , 1988 .
[31] Joseph Y. Halpern,et al. Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.
[32] Fahiem Bacchus,et al. Planning for temporally extended goals , 1996, Annals of Mathematics and Artificial Intelligence.
[33] Steffen Staab,et al. Efficiency of Ontology Mapping Approaches , 2004 .
[34] Drew McDermott,et al. Overcoming Ontology Mismatches in Transactions with Self-Describing Service Agents , 2001, SWWS.
[35] Diego Calvanese,et al. Relationships with other Formalisms , 2003, Description Logic Handbook.
[36] Fausto Giunchiglia,et al. Planning as Model Checking , 1999, ECP.
[37] Sofia Cassel,et al. Graph-Based Algorithms for Boolean Function Manipulation , 2012 .
[38] Hector Muñoz-Avila,et al. SHOP: Simple Hierarchical Ordered Planner , 1999, IJCAI.
[39] Daniele Nardi,et al. An Introduction to Description Logics , 2003, Description Logic Handbook.
[40] Beat Schmid,et al. The Concept of Media , 1997 .
[41] Stanley J. Rosenschein,et al. Plan Synthesis: A Logical Perspective , 1981, IJCAI.
[42] Michel Klein,et al. Combining and relating ontologies: an analysis of problems and solutions , 2001, OIS@IJCAI.
[43] Jesfis Peral,et al. Heuristics -- intelligent search strategies for computer problem solving , 1984 .
[44] Allen Newell,et al. GPS, a program that simulates human thought , 1995 .
[45] Dongwon Lee,et al. Comparative analysis of six XML schema languages , 2000, SGMD.
[46] Ivan Serina,et al. Planning in PDDL2.2 Domains with LPG-td , 2004 .
[47] David E. Smith,et al. Conformant Graphplan , 1998, AAAI/IAAI.
[48] Jörg Hoffmann,et al. FF: The Fast-Forward Planning System , 2001, AI Mag..
[49] Leon Sterling,et al. Relating Stable Models and AI Planning Domains , 1995 .
[50] Marvin Minsky,et al. A framework for representing knowledge , 1974 .
[51] C. Petri. Kommunikation mit Automaten , 1962 .
[52] James A. Hendler,et al. Automating DAML-S Web Services Composition Using SHOP2 , 2003, SEMWEB.
[53] Katia P. Sycara,et al. An Efficient Algorithm for OWL-S Based Semantic Search in UDDI , 2004, SWSWPC.
[54] Piergiorgio Bertoli,et al. Extending PDDL to nondeterminism, limited sensing and iterative conditional plans , 2003 .
[55] Fahiem Bacchus,et al. Using temporal logic to control search in a forward chaining planner , 1996 .
[56] Henry A. Kautz,et al. BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving , 1998 .
[57] Subbarao Kambhampati,et al. Reviving Partial Order Planning , 2001, IJCAI.
[58] Maria Fox,et al. The Automatic Inference of State Invariants in TIM , 1998, J. Artif. Intell. Res..
[59] Oren Etzioni,et al. An Approach to Planning with Incomplete Information , 1992, KR.
[60] Marco Pistore,et al. Planning with a language for extended goals , 2002, AAAI/IAAI.
[61] Bart Selman,et al. The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework , 1998, AIPS.
[62] Maria Fox,et al. PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..
[63] Dana S. Nau,et al. SHOP2: An HTN Planning System , 2003, J. Artif. Intell. Res..
[64] David E. Smith,et al. Bridging the gap between planning and scheduling , 2000, The Knowledge Engineering Review.
[65] Ian Horrocks,et al. Using an Expressive Description Logic: FaCT or Fiction? , 1998, KR.
[66] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[67] Manuela M. Veloso,et al. OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains , 2000, J. Artif. Intell. Res..
[68] Thomas R. Gruber,et al. A translation approach to portable ontology specifications , 1993, Knowl. Acquis..
[69] York Sure-Vetter,et al. Ontology Mapping - An Integrated Approach , 2004, ESWS.
[70] Dan Brickley,et al. Rdf vocabulary description language 1.0 : Rdf schema , 2004 .
[71] Ray Reiter,et al. On knowledge-based programming with sensing in the situation calculus , 2001, ACM Trans. Comput. Log..
[72] Takahiro Kawamura,et al. Semantic Matching of Web Services Capabilities , 2002, SEMWEB.
[73] Hector J. Levesque,et al. The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.
[74] Vladimir Lifschitz,et al. ON THE SEMANTICS OF STRIPS , 1987 .
[75] Juliana Freire,et al. XSB: A System for Effciently Computing WFS , 1997, LPNMR.
[76] Håkan L. S. Younes,et al. VHPOP: Versatile Heuristic Partial Order Planner , 2003, J. Artif. Intell. Res..
[77] Steffen Hölldobler,et al. Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams , 2000, Computational Logic.
[78] Hector J. Levesque,et al. Foundations for the Situation Calculus , 1998, Electron. Trans. Artif. Intell..
[79] Earl D. Sacerdott. Planning in a hierarchy of abstraction spaces , 1973, IJCAI 1973.
[80] D. Long,et al. E cient Implementation of the Plan Graph in STAN , 1999 .
[81] Bo Leuf,et al. The Wiki Way: Quick Collaboration on the Web , 2001 .
[82] James A. Hendler,et al. Semantics for HTN Planning , 1998 .
[83] Shankar Ponnekanti,et al. SWORD: A Developer Toolkit for Web Service Composition , 2008 .
[84] James A. Hendler,et al. UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning , 1994, AIPS.
[85] David E. Smith,et al. Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.
[86] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[87] Earl D. Sacerdoti,et al. The Nonlinear Nature of Plans , 1975, IJCAI.
[88] Drew McDermott,et al. DRS: A Set of Conventions for Representing Logical Languages in RDF , 2004 .
[89] Andreas Herzig,et al. Formalizing Action and Change in Modal Logic I: the frame problem , 1999, J. Log. Comput..
[90] J. McCarthy. Situations, Actions, and Causal Laws , 1963 .
[91] Werner Nutt,et al. Basic Description Logics , 2003, Description Logic Handbook.
[92] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.
[93] Bernhard Nebel,et al. Ignoring Irrelevant Facts and Operators in Plan Generation , 1997, ECP.
[94] Malte Helmert,et al. On the Implementation of MIPS , 2000 .
[95] J. Hoffmann,et al. What Makes The Difference Between HSP and FF ? , 2002 .
[96] Tran Cao Son,et al. Adapting Golog for Composition of Semantic Web Services , 2002, KR.
[97] Marco Pistore,et al. Automated Composition of Semantic Web Services into Executable Processes , 2004, SEMWEB.
[98] Hector J. Levesque,et al. GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..
[99] Donald E. Knuth,et al. Computer programming as an art , 1974, CACM.
[100] Holger Herbst,et al. Business rule oriented conceptual modeling , 2000 .
[101] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[102] Piergiorgio Bertoli,et al. MBP: a Model Based Planner , 2001 .
[103] Ian Horrocks,et al. OWL-Eu: Adding Customised Datatypes into OWL , 2005, ESWC.
[104] Ian Horrocks,et al. FaCT and iFaCT , 1999, Description Logics.
[105] Richard Fikes,et al. The Ontolingua Server: a tool for collaborative ontology construction , 1997, Int. J. Hum. Comput. Stud..
[106] Sharma Chakravarthy,et al. Design of Sentinel: an object-oriented DMBS with event-based rules , 1994, Inf. Softw. Technol..
[107] Malte Helmert,et al. A Planning Heuristic Based on Causal Graph Analysis , 2004, ICAPS.
[108] Nils J. Nilsson,et al. Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[109] Jana Koehler,et al. Web Service Composition - Current Solutions and Open Problems , 2003 .
[110] Sharma Chakravarthy,et al. Snoop: An Expressive Event Specification Language for Active Databases , 1994, Data Knowl. Eng..
[111] Robert C. Moore. A Formal Theory of Knowledge and Action , 1984 .
[112] Stephen J. Garland,et al. Larch: Languages and Tools for Formal Specification , 1993, Texts and Monographs in Computer Science.
[113] J. Ho,et al. The Metric FF Planning System Translating Ignoring Delete Lists to Numeric State Variables , 2003 .
[114] Edwin P. D. Pednault,et al. ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.
[115] Amy L. Lansky,et al. Reactive Reasoning and Planning , 1987, AAAI.
[116] Lenhart K. Schubert,et al. Accelerating partial order planners by improving plan and goal choices , 1995, Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence.
[117] Beat F. Schmid,et al. Logic for media. The computational media metaphor , 1999, Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers.
[118] Steve Hanks,et al. Flaw Selection Strategies for Value-Directed Planning , 1996, AIPS.
[119] Hudson Turner,et al. Representing Actions in Logic Programs and Default Theories: A Situation Calculus Approach , 1997, J. Log. Program..
[120] Alexander Borgida,et al. Description Logics in Data Management , 1995, IEEE Trans. Knowl. Data Eng..
[121] Richard E. Korf,et al. Linear-Space Best-First Search , 1993, Artif. Intell..
[122] Keith Golden,et al. Planning and knowledge representation for softbots , 1997 .
[123] Volker Haarslev,et al. RACER System Description , 2001, IJCAR.
[124] Ivan Serina,et al. LPG: A Planner Based on Local Search for Planning Graphs with Action Costs , 2002, AIPS.
[125] Beat Schmid,et al. Elektronische Märkte - Merkmale, Organisation und Potentiale , 1999 .
[126] Ian Horrocks,et al. From SHIQ and RDF to OWL: the making of a Web Ontology Language , 2003, J. Web Semant..
[127] Mark Jeffrey Stefik. Planning with constraints , 1980 .
[128] Bart Selman,et al. Control Knowledge in Planning: Benefits and Tradeoffs , 1999, AAAI/IAAI.
[129] C. V. Ramamoorthy,et al. Semantic Web Services , 2010 .
[130] John McCarthy,et al. SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .
[131] Jeannette M. Wing,et al. Signature matching: a tool for using software libraries , 1995, TSEM.
[132] Marcelo Arenas,et al. A normal form for XML documents , 2002, PODS '02.
[133] Ian Horrocks,et al. Extending Datatype Support in Web Ontology Reasoning , 2002, OTM.
[134] Claudio Bartolini,et al. A Semantic Web Approach to Service Description for Matchmaking of Services , 2001, SWWS.
[135] Subbarao Kambhampati,et al. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP , 2001, Artif. Intell..
[136] James A. Hendler,et al. Complexity results for HTN planning , 1994, Annals of Mathematics and Artificial Intelligence.
[137] Ian Horrocks,et al. A Software Framework for Matchmaking Based on Semantic Web Technology , 2004, Int. J. Electron. Commer..
[138] Rolf Grütter,et al. Software-Agenten im Semantic Web , 2006, Informatik-Spektrum.
[139] Fausto Giunchiglia,et al. Planning via Model Checking: A Decision Procedure for AR , 1997, ECP.
[140] Natalya F. Noy,et al. Semantic integration: a survey of ontology-based approaches , 2004, SGMD.
[141] Ian Horrocks,et al. Description logic programs: combining logic programs with description logic , 2003, WWW '03.
[142] Mark A. Peot,et al. Threat-Removal Strategies for Partial-Order Planning , 1993, AAAI.
[143] Michael R. Lowry,et al. Formal Analysis of a Space-Craft Controller Using SPIN , 2001, IEEE Trans. Software Eng..
[144] Alexander Borgida,et al. On the Relative Expressiveness of Description Logics and Predicate Logics , 1996, Artif. Intell..
[145] James A. Hendler,et al. The Semantic Web" in Scientific American , 2001 .
[146] CORPORATE The Joint Task Force on Computing Curricula,et al. Computing curricula 2001 , 2001, JERC.
[147] Hector J. Levesque,et al. ConGolog, a concurrent programming language based on the situation calculus , 2000, Artif. Intell..
[148] Subbarao Kambhampati,et al. On the Role of Disjunctive Representations and Constraint Propagation in Refinement Planning , 1996, KR.
[149] Dieter Fensel,et al. A conceptual architecture for semantic web enabled web services , 2002, SGMD.
[150] Laura Giordano,et al. Dealing with Concurrent Actions in Modal Action Logics , 1998, ECAI.
[151] H. Lan,et al. SWRL : A semantic Web rule language combining OWL and ruleML , 2004 .
[152] Raymond Reiter,et al. Some contributions to the metatheory of the situation calculus , 1999, JACM.
[153] Paolo Traverso,et al. Strong Cyclic Planning Revisited , 1999, ECP.
[154] Reid G. Simmons,et al. A task description language for robot control , 1998, Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190).
[155] Matthias Klusch,et al. Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace , 2002, Autonomous Agents and Multi-Agent Systems.
[156] Austin Tate,et al. Generating Project Networks , 1977, IJCAI.
[157] Monika Gruber. Alfred Tarski and the "Concept of Truth in Formalized Languages" , 2016 .
[158] Tran Cao Son,et al. Adapting Golog for Programming the Semantic Web , 2001 .
[159] Bernhard Nebel,et al. Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.
[160] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[161] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .
[162] C. Cordell Green,et al. Application of Theorem Proving to Problem Solving , 1969, IJCAI.
[163] J. Gonzalez-Castillo,et al. Description logics for matchmaking of services , 2001 .
[164] David Chapman,et al. Planning for Conjunctive Goals , 1987, Artif. Intell..
[165] E. Allen Emerson,et al. Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[166] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[167] Maria-Esther Vidal,et al. Wrapper generation for Web accessible data sources , 1998, Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122).
[168] Christopher A. Brooks. An Introduction to Web Services , 2002 .
[169] Dieter Fensel,et al. A Conceptual Comparison of WSMO and OWL-S , 2004, ECOWS.
[170] Jörg Hoffmann,et al. Extending FF to Numerical State Variables , 2002, ECAI.
[171] Drew McDermott,et al. Estimated-Regression Planning for Interactions with Web Services , 2002, AIPS.
[172] David A. McAllester,et al. Systematic Nonlinear Planning , 1991, AAAI.
[173] Joachim Peer,et al. Bringing Together Semantic Web and Web Services , 2002, SEMWEB.
[174] M. Helmert,et al. Fast Downward Making use of causal dependencies in the problem representation , 2004 .
[175] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.
[176] Drew McDermott,et al. The 1998 AI Planning Systems Competition , 2000, AI Mag..
[177] Maurizio Lenzerini,et al. PDL-based framework for reasoning about actions , 1995, AI*IA.
[178] Joachim Peer,et al. A Proposal for a Semantic Web Service Description Format , 2004, ECOWS.
[179] Martha E. Pollack,et al. Least-Cost Flaw Repair: A Plan Refinement Strategy for Partial-Order Planning , 1994, AAAI.
[180] Oren Etzioni,et al. The First Law of Robotics (A Call to Arms) , 1994, AAAI.
[181] Maurizio Lenzerini,et al. Representing and Using Interschema Knowledge in Cooperative Information Systems , 1993, Int. J. Cooperative Inf. Syst..
[182] Vladimir Lifschitz,et al. Action Languages, Answer Sets, and Planning , 1999, The Logic Programming Paradigm.
[183] Martha E. Pollack,et al. Flaw Selection Strategies for Partial-Order Planning , 1997, J. Artif. Intell. Res..
[184] Beat F. Schmid,et al. Elements of a reference model for electronic markets , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.
[185] Jörg Hoffmann,et al. On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm , 2000, J. Artif. Intell. Res..
[186] Calton Pu,et al. Wrapping web data into XML , 2001, SGMD.