RBSLA: Rule based service level agreements: RBSLA; knowledge representation for automated e-contract, SLA and policy management
暂无分享,去创建一个
[1] Diego Calvanese,et al. Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .
[2] Antony Galton,et al. A unifying semantics for time and events , 2004, Artif. Intell..
[3] Alan S. Abrahams. Representing and Enforcing E-Commerce Contracts Using Occurrences , 2002 .
[4] M. Mowbray,et al. A Completeness Result for SLDNF-Resolution , 1993, GULP.
[5] Gerd Wagner,et al. Rule-based agents for the semantic web , 2003, Electron. Commer. Res. Appl..
[6] Marek J. Sergot,et al. A logic-based calculus of events , 1989, New Generation Computing.
[7] Francesco Buccafurri,et al. Stable Models and Their Computation for Logic Programming with Inheritance and True Negation , 1996, J. Log. Program..
[8] Jos de Bruijn,et al. Web Service Modeling Ontology , 2005, Appl. Ontology.
[9] Dov M. Gabbay,et al. Credulous vs. Sceptical Semantics for Ordered Logic Programs , 1991, KR.
[10] David Lewis,et al. Semantic Analyses for Dyadic Deontic Logic , 1974 .
[11] Asit Dan,et al. Web services on demand: WSLA-driven automated management , 2004, IBM Syst. J..
[12] Alexander Leitsch,et al. The Resolution Calculus , 1997, Texts in Theoretical Computer Science An EATCS Series.
[13] John S. Schlipf. Formalizing a logic for logic programming , 2005, Annals of Mathematics and Artificial Intelligence.
[14] Frederick Hayes-Roth,et al. Rule-based systems , 1985, CACM.
[15] Ian Horrocks,et al. Description logic programs: combining logic programs with description logic , 2003, WWW '03.
[16] Derek H. Sleeman,et al. Automating the Refinement of Knowledge-Based Systems , 1990, ECAI.
[17] Akhil Sahai,et al. Towards Automated SLA Management for Web Services , 2002 .
[18] J. W. Lloyd,et al. Foundations of logic programming; (2nd extended ed.) , 1987 .
[19] José Júlio Alferes,et al. Well Founded Semantics for Logic Programs with Explicit Negation , 1992, ECAI.
[20] Andreas Abecker. TaxLog: A Flexible Architecture for Logic Programming with Structured Types and Constraints , 1993 .
[21] Michael Gelfond,et al. Logic Programs with Classical Negation , 1990, ICLP.
[22] Alan Mycroft,et al. A Polymorphic Type System for Prolog , 1984, Logic Programming Workshop.
[23] Hector J. Levesque,et al. Expressiveness and tractability in knowledge representation and reasoning 1 , 1987, Comput. Intell..
[24] Amit P. Sheth,et al. Adding Semantics to Web Services Standards , 2003, ICWS.
[25] Carlo Zaniolo,et al. A Unified Semantics for Active and Deductive Databases , 1993, Rules in Database Systems.
[26] Jorge Lobo,et al. Semantics for update rule programs and implementation in a relational database management system , 1996, TODS.
[27] Maurizio Lenzerini,et al. TBox and ABox Reasoning in Expressive Description Logics , 1996, KR.
[28] Oliver Jack. Software testing for conventional and logic programming , 1995 .
[29] Jennifer Widom,et al. Set-oriented production rules in relational database systems , 1990, SIGMOD '90.
[30] Gopalan Nadathur,et al. Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..
[31] Olivera Marjanovic,et al. Towards formal modeling of e-contracts , 2001, Proceedings Fifth IEEE International Enterprise Distributed Object Computing Conference.
[32] Gregor von Bochmann,et al. Control-flow based testing of Prolog programs , 1992, [1992] Proceedings Third International Symposium on Software Reliability Engineering.
[33] Gopalan Nadathur,et al. Implementing Polymorphic Typing in a Logic Programming Language , 1994, Comput. Lang..
[34] François Bry,et al. Negation in Logic Programming: A Formalization in Constructive Logic , 1990, IS/KI.
[35] Opher Etzion,et al. Amit - the situation manager , 2003, The VLDB Journal.
[36] Douglas W. Bennett,et al. Designing Hard Software: The Essential Tasks , 1997 .
[37] Michael Gelfond,et al. Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.
[38] Raymond Reiter,et al. Towards a Logical Reconstruction of Relational Database Theory , 1982, On Conceptual Modelling.
[39] Justin Zobel,et al. Efficient Run-Time Type Checking of Typed Logic Programs , 1992, J. Log. Program..
[40] Gösta Grahne,et al. Information Integration and Incomplete Information , 2002, IEEE Data Eng. Bull..
[41] Allen Van Gelder,et al. The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..
[42] Adrian Paschke,et al. A Categorization Scheme for SLA Metrics , 2006, Service Oriented Electronic Commerce.
[43] Prateek Mishra,et al. Declaration-free type checking , 1985, POPL.
[44] Robert A. Kowalski,et al. The Semantics of Predicate Logic as a Programming Language , 1976, JACM.
[45] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[46] Jürgen Dix,et al. Partial Evaluation and Relevance for Approximations of Stable Semantics , 1994, ISMIS.
[47] João Leite,et al. Evolving knowledge bases : specification and semantics , 2003 .
[48] Lobel Crnogorac,et al. Abstract Interpretation of Active Rules and its Use in Termination Analysis , 1997, ICDT.
[49] Hans Tompits,et al. Combining answer set programming with description logics for the Semantic Web , 2004, Artif. Intell..
[50] Gerhard Brewka. On the Relationship between Defeasible Logic and Well-Founded Semantics , 2001, LPNMR.
[51] José Júlio Alferes,et al. Evolving Logic Programs , 2002, JELIA.
[52] Prateek Mishra,et al. Towards a Theory of Types in Prolog , 1984, SLP.
[53] Jennifer Widom,et al. Behavior of database production rules: termination, confluence, and observable determinism , 1992, SIGMOD '92.
[54] Gerd Wagner,et al. HEINRICH HERRE, JAN JASPARS AND GERD WAGNER PARTIAL LOGICS WITH TWO KINDS OF NEGATION AS A FOUNDATION FOR KNOWLEDGE-BASED REASONING , 2006 .
[55] Michael Hanus. Logic Programming with Type Specifications , 1992, Types in Logic Programming.
[56] Raymond Reiter,et al. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2001 .
[57] Jorge Lobo,et al. Foundations of disjunctive logic programming , 1992, Logic Programming.
[58] Michael Gelfond,et al. Representing Action and Change by Logic Programs , 1993, J. Log. Program..
[59] David Makinson. On the formal representation of rights relations , 1986, J. Philos. Log..
[60] Teodor C. Przymusinski. Stable semantics for disjunctive programs , 1991, New Generation Computing.
[61] Li-Yan Yuan,et al. SLT-Resolution for the Well-Founded Semantics , 2004, Journal of Automated Reasoning.
[62] Alexandra Poulovassilis,et al. An event-condition-action language for XML , 2002, WWW '02.
[63] Luca Cardelli,et al. The Computer Science and Engineering Handbook , 1997 .
[64] Hans Tompits,et al. A Framework for Declarative Update Specifications in Logic Programs , 2001, IJCAI.
[65] Robert C. Moore. Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.
[66] Steffen Hölldobler,et al. A new deductive approach to planning , 1989, New Generation Computing.
[67] Christoph Beierle,et al. PROTOS-L: Towards a Knowledge Base Programming Language , 1989, Wissensbasierte Systeme.
[68] Ronald M. Lee,et al. Defeasible deontic reasoning: a logic programming model , 1994 .
[69] Gerd Wagner,et al. Supporting Open and Closed World Reasoning on the Web , 2006, PPSWR.
[70] James Skene,et al. SLAng: a language for service level agreements , 2003 .
[71] Andreas Podelski,et al. Towards a Meaning of LIFE , 1991, PLILP.
[72] George Antoniou. Relating Defeasible Logic to Extended Logic Programs , 2002, SETN.
[73] Jaap Hage. Contrary to Duty Obligations A Study in Legal Ontology , 2001 .
[74] David Scott Warren,et al. Query evaluation under the well-founded semantics , 1993, PODS.
[75] Frank Pfenning,et al. Types in Logic Programming , 1992, ICLP.
[76] Martin Bichler,et al. SLA Representation, Management and Enforcement - Combining Event Calculus, Deontic Logic, Horn Logic and Event Condition Action Rules , 2005 .
[77] Gerhard Brewka. Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences , 1996, J. Artif. Intell. Res..
[78] Risto Hilpinen,et al. Deontic Logic: An Introduction , 1970 .
[79] Grigoris Antoniou. Verification and correctness issues for nonmonotonic knowledge bases , 1997 .
[80] Miroslaw Truszczynski,et al. On the problem of computing the well-founded semantics , 2001, Theory Pract. Log. Program..
[81] Stefano Paraboschi,et al. Pushing reactive services to XML repositories using active rules , 2002, Comput. Networks.
[82] Trevor J. M. Bench-Capon,et al. Maintenance of Knowledge-based Systems , 1993 .
[83] Michael Kifer,et al. Transaction Logic Programming (or, A Logic of Procedural and Declarative Knowledge) , 1995 .
[84] Michael Eckert,et al. Reactivity on the web: paradigms and applications of the language XChange , 2005, SAC '05.
[85] Sharma Chakravarthy,et al. Composite Events for Active Databases: Semantics, Contexts and Detection , 1994, VLDB.
[86] R. A. Stachowitz,et al. A report on the Expert Systems Validation Associate (EVA) , 1990 .
[87] Paul W. P. J. Grefen,et al. Contract-driven creation and operation of virtual enterprises , 2001, Comput. Networks.
[88] Mohamed A. Khamsi,et al. Fixed point theorems in logic programming , 1997, Annals of Mathematics and Artificial Intelligence.
[89] R. Peterson. Integration Strategies and Tactics for Information Technology Governance , 2004 .
[90] François Bry,et al. Query Evaluation in Recursive Databases , 1990 .
[91] James A. Hendler,et al. The Semantic Web" in Scientific American , 2001 .
[92] Fatma Bouali,et al. Revision of Rule Bases , 1997, EUROVAV.
[93] John McCarthy,et al. Programs with common sense , 1960 .
[94] Kenneth A. Ross,et al. A procedural semantics for well founded negation in logic programs , 1989, J. Log. Program..
[95] Riccardo Rosati,et al. On the decidability and complexity of integrating ontologies and rules , 2005, J. Web Semant..
[96] Phan Minh Dung,et al. Negations as Hypotheses: An Abductive Foundation for Logic Programming , 1991, ICLP.
[97] Dan Brickley,et al. Rdf vocabulary description language 1.0 : Rdf schema , 2004 .
[98] Anupam Joshi,et al. Declarative Policies for Describing Web Service Capabilities and Constraints , 2004 .
[99] Stefan Decker,et al. TRIPLE - A Query, Inference, and Transformation Language for the Semantic Web , 2002, SEMWEB.
[100] Robert Meolic,et al. An Action Computation Tree Logic With Unless Operator , 2003 .
[101] John C. Shepherdson. Unsolvable Problems for SLDNF Resolution , 1991, J. Log. Program..
[102] Adrian Paschke,et al. Typed Hybrid Description Logic Programs with Order-Sorted Semantic Web Type Systems based on OWL and RDFS , 2005 .
[103] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[104] M. Belzer. Legal reasoning in 3-D , 1987, ICAIL '87.
[105] Stijn Heymans,et al. Nonmonotonic Ontological and Rule-Based Reasoning with Extended Conceptual Logic Programs , 2005, ESWC.
[106] Stefano Paraboschi,et al. Active XQuery , 2002, Proceedings 18th International Conference on Data Engineering.
[107] John W. Lloyd,et al. The Gödel programming language , 1994 .
[108] Jeremy J. Carroll,et al. Resource description framework (rdf) concepts and abstract syntax , 2003 .
[109] Uday S. Reddy,et al. Typed Prolog: A Semantic Reconstruction of the Mycroft-O'Keefe Type System , 1991, ISLP.
[110] Teodor C. Przymusinski. The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..
[111] Jens Dietrich,et al. On the Test-Driven Development and Validation of Business Rules , 2005, ISTA.
[112] Melvin Fitting,et al. First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.
[113] Jeffrey M. Bradshaw,et al. KAoS Semantic Policy and Domain Services: An Application of DAML to Web Services-Based Grid Architectures , 2003 .
[114] Gert Smolka. Logic Programming over Polymorphically Order-Sorted Types , 1989 .
[115] David Scott Warren,et al. A Goal-Oriented Approach to Computing the Well-Founded Semantics , 1993, J. Log. Program..
[116] Hector J. Levesque,et al. An Essential Hybrid Reasoning System: Knowledge and Symbol Level Accounts of KRYPTON , 1985, IJCAI.
[117] Antonis C. Kakas,et al. A Simple Declarative Language for Describing Narratives With Actions , 1997, J. Log. Program..
[118] Bertram Ludäscher,et al. A Logical Framework for Active Rules , 1996, COMAD.
[119] José Júlio Alferes,et al. SLX - A Top-down Derivation Procedure for Programs with Explicit Negation , 1994, ILPS.
[120] Murray Shanahan,et al. The Event Calculus in Classical Logic - Alternative Axiomatisations , 1999, Electron. Trans. Artif. Intell..
[121] Jürgen Dix,et al. Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated Gcwa , 1997 .
[122] Patrick Doherty,et al. TAL: Temporal Action Logics Language Specification and Tutorial , 1998, Electron. Trans. Artif. Intell..
[123] Michael J. Maher,et al. A Flexible Framework for Defeasible Logics , 2000, AAAI/IAAI.
[124] Robert A. Kowalski,et al. Variants of the Event Calculus , 1995, ICLP.
[125] Jie Li,et al. DatalogDL: Datalog Rules Parameterized by Description Logics , 2006, CSWWS.
[126] Massimo Marchiori,et al. Query + Metadata + Logic = Metalog , 1998, QL.
[127] David S. Touretzky,et al. A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks , 1987, Artif. Intell..
[128] Michael J. Maher,et al. Representation results for defeasible logic , 2000, TOCL.
[129] José Júlio Alferes,et al. On the Use of Multi-dimensional Dynamic Logic Programming to Represent Societal Agents' Viewpoints , 2001, EPIA.
[130] H. Lan,et al. SWRL : A semantic Web rule language combining OWL and ruleML , 2004 .
[131] Thomas R. Gruber,et al. A translation approach to portable ontology specifications , 1993, Knowl. Acquis..
[132] Alun D. Preece,et al. Foundation and application of knowledge base verification , 1994, Int. J. Intell. Syst..
[133] Li-Yan Yuan,et al. Three-valued formalization of logic programming: is it needed? , 1990, PODS '90.
[134] Serge Abiteboul,et al. Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..
[135] Jeff Heflin,et al. LCW-Based Agent Planning for the Semantic Web , 2002 .
[136] P. Legay,et al. WELL!: An Evaluation Procedure for All Logic Programs , 1990, ICDT.
[137] Melvin Fitting. Well-Founded Semantics, Generalized , 1991, ISLP.
[138] E. F. Codd,et al. A data base sublanguage founded on the relational calculus , 1971, SIGFIDET '71.
[139] Teodor C. Przymusinski,et al. Weakly Perfect Model Semantics for Logic Programs , 1988, ICLP/SLP.
[140] Kunal Verma,et al. Semantic Matching of Web Service Policies , 2005, SDWP@ICWS.
[141] Sandro Etalle,et al. On the Unification Free Prolog Programs , 1993, MFCS.
[142] Adrian Paschke,et al. ECA-RuleML/ECA-LP: A Homogeneous Event-Condition-Action Logic Programming Language , 2006 .
[143] Norman W. Paton,et al. Active Rules in Database Systems , 1998, Monographs in Computer Science.
[144] John C. Mitchell,et al. On the Sequential Nature of Unification , 1984, J. Log. Program..
[145] John McCarthy,et al. SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .
[146] E. Mally. Grundgesetze des Sollens , .
[147] Catriel Beeri,et al. On the power of magic , 1987, J. Log. Program..
[148] A. Paschke,et al. NPL: Negotiation Pattern Language A Design Pattern Language for Decentralized Coordination and Negotiation Protocols , 2006 .
[149] Shinichi Morishita,et al. An Extension of Van Gelder's Alternating Fixpoint to Magic Programs , 1996, J. Comput. Syst. Sci..
[150] Norman W. Paton,et al. Formal Specification of Active Database Functionality: A Survey , 1995, Rules in Database Systems.
[151] Marek J. Sergot,et al. A Formal Characterisation of Institutionalised Power , 1996, Log. J. IGPL.
[152] Adrian Paschke. ECA-RuleML: An Approach combining ECA Rules with temporal interval-based KR Event/Action Logics and Transactional Update Logics , 2006, ArXiv.
[153] Vladimir Lifschitz,et al. Answer Sets in General Nonmonotonic Reasoning (Preliminary Report) , 1992, KR.
[154] Maurice Bruynooghe,et al. On the Local Closed-World Assumption of Data-Sources , 2005, BNAIC.
[155] Krzysztof R. Apt,et al. Contributions to the Theory of Logic Programming , 1982, JACM.
[156] Giuseppe Psaila,et al. Composite Events in Chimera , 1996, EDBT.
[157] Michael Kifer,et al. Flora-2: A Rule-Based Knowledge Representation and Inference Infrastructure for the Semantic Web , 2003, OTM.
[158] Evgeny Dantsin,et al. Complexity of Query Answering in Logic Databases with Complex Values , 1998 .
[159] Christopher Strachey,et al. Fundamental Concepts in Programming Languages , 2000, High. Order Symb. Comput..
[160] Teodor C. Przymusinski. Every logic program has a natural stratification and an iterated least fixed point model , 1989, PODS.
[161] Francesco M. Donini,et al. Decidable Reasoning in Terminological Knowledge Representation Systems , 1993, IJCAI.
[162] Arnold Oberschelp. Untersuchungen zur mehrsortigen Quantorenlogik , 1962 .
[163] Kenneth A. Ross. Modular Stratification and Magic Sets for Datalog Programs with Negation , 1994, J. ACM.
[164] Louiqa Raschid,et al. A Semantics for a Class of Stratified Production System Programs , 1989, J. Log. Program..
[165] Todd D. Millstein,et al. Query containment for data integration systems , 2003, J. Comput. Syst. Sci..
[166] Erik Sandewall,et al. Combining Logic and Differential Equations for Describing Real-World Systems , 1989, KR.
[167] John S. Schlipf,et al. The Expressive Powers of the Logic Programming Semantics , 1995, J. Comput. Syst. Sci..
[168] Lois M. L. Delcambre,et al. A self-controlling interpreter for the relational production language , 1988, SIGMOD '88.
[169] Giovanni Della-Libera,et al. Web Services Security Policy Language (WS-SecurityPolicy) , 2002 .
[170] Angelo Montanari,et al. A General Modal Framework for the Event Calculus and Its Skeptical and Credulous Variants , 1999, J. Log. Program..
[171] Peter J. Stuckey,et al. Type constraint solving for parametric and ad-hoc polymorphism , 1998 .
[172] Peter F. Patel-Schneider,et al. Reducing OWL entailment to description logic satisfiability , 2004, Journal of Web Semantics.
[173] Peter J. Stuckey,et al. Well-Founded Ordered Search: Goal-Directed Bottom-Up Evaluation of Well-Founded Models , 1997, J. Log. Program..
[174] Antonis C. Kakas,et al. An Argumentation Framework of Reasoning about Actions and Change , 1999, LPNMR.
[175] Sharma Chakravarthy,et al. The HiPAC Project , 1996, Active Database Systems: Triggers and Rules For Advanced Database Processing.
[176] Gary M. Kern. A Framework for Service Management of Information Systems , 1998 .
[177] Mark E. Stickel. Schubert's Steamroller problem: Formulations and solutions , 2004, Journal of Automated Reasoning.
[178] Joxan Jaffar,et al. Semantic Types for Logic Programs , 1992, Types in Logic Programming.
[179] Jürgen Dix,et al. Transformation-based bottom-up computation of the well-founded model , 1996, Theory and Practice of Logic Programming.
[180] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[181] Sukhamay Kundu,et al. The Strong Semantics for Logic Programs , 1991, ISMIS.
[182] Martin Bichler,et al. Design science in information systems research , 2006, Wirtschaftsinf..
[183] Justin Zobel,et al. Derivation of Polymorphic Types for PROLOG Programs , 1987, ICLP.
[184] Jürgen Dix,et al. A Framework for Representing and Characterizing Semantics of Logic Programs , 1992, KR.
[185] Jack Minker,et al. An Overview of Nonmonotonic Reasoning and Logic Programming , 1993, J. Log. Program..
[186] J. Goguen,et al. Order-Sorted Equational Computation , 1989 .
[187] Pascal Van Hentenryck,et al. Type analysis of Prolog using type graphs , 1994, PLDI '94.
[188] Asit Dan,et al. Cremona: an architecture and library for creation and monitoring of WS-agreents , 2004, ICSOC '04.
[189] Carlo Zaniolo. Active Database Rules with Transaction-Conscious Stable-Model Semantics , 1995, DOOD.
[190] Alon Y. Halevy,et al. CARIN: A Representation Language Combining Horn Rules and Description Logics , 1996, ECAI.
[191] Christoph Walther,et al. A Many-Sorted Calculus Based on Resolution and Paramodulation , 1982, IJCAI.
[192] Jorge Lobo,et al. Weak Generalized Closed World Assumption , 1989, Journal of Automated Reasoning.
[193] Melvin Fitting,et al. A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..
[194] Ian Horrocks,et al. Description Logics as Ontology Languages for the Semantic Web , 2005, Mechanizing Mathematical Reasoning.
[195] Justin Zobel,et al. A Regular Type Language for Logic Programs , 1992, Types in Logic Programming.
[196] R. Kowalski,et al. Linear Resolution with Selection Function , 1971 .
[197] Martin Gogolla,et al. Über partiell geordnete Sortenmengen und deren Anwendung zur Fehlerbehandlung in abstrakten Datentypen , 1986 .
[198] Michael J. Maher,et al. Defeasible Logic versus Logic Programming without Negation as Failure , 2000, J. Log. Program..
[199] Frank Teusink,et al. A Proof Procedure for Extended Logic Programs , 1993, ILPS.
[200] D. Warren. An argumentation semantics for logic programming with explicit negation , 1993 .
[201] Murray Shanahan. Event Calculus Planning Revisited , 1997, ECP.
[202] Santosh K. Shrivastava,et al. Contract representation for run-time monitoring and enforcement , 2003, EEE International Conference on E-Commerce, 2003. CEC 2003..
[203] José Meseguer,et al. EQLOG: Equality, Types, and Generic Modules For Logic Programming , 1986, Logic Programming: Functions, Relations, and Equations.
[204] Premkumar T. Devanbu,et al. GlueQoS: middleware to sweeten quality-of-service policy interactions , 2004, Proceedings. 26th International Conference on Software Engineering.
[205] Gerd Wagner. How to Design a General Rule Markup Language? , 2002, XSW.
[206] Murray Shanahan,et al. Representing Continuous Change in the Event Calculus , 1990, ECAI.
[207] Ehud Shapiro,et al. Algorithmic Program Debugging , 1983 .
[208] Frank van Harmelen,et al. Verification and Validation of Knowledge-Based Systems: Report on Two 1997 Events , 1998, AI Mag..
[209] Michael Schroeder,et al. PROVA: Rule-Based Java-Scripting for a Bioinformatics Semantic Web , 2004, DILS.
[210] Amit P. Sheth,et al. Modeling Quality of Service for Workflows and Web Service Processes , 2002 .
[211] Andrew J. I. Jones,et al. Deontic Logic and Contrary-to-Duties , 2002 .
[212] Sailesh Chutani,et al. SLA management in federated environments , 2001, Comput. Networks.
[213] Teodor C. Przymusinski. On the declarative and procedural semantics of logic programs , 1989, Journal of Automated Reasoning.
[214] Michael Hanus. Horn Clause Programs with Polymorphic Types: Semantics and Resolution , 1991, Theor. Comput. Sci..
[215] Jorge Lobo,et al. Generalized disjunctive well-founded semantics for logic programs , 2005, Annals of Mathematics and Artificial Intelligence.
[216] Jorge Lobo,et al. Generalized Well-founded Semantics for Logic Programs (Extended Abstract) , 1990, CADE.
[217] Divesh Srivastava,et al. Bottom-Up Evaluation and Query Optimization of Well-Founded Models , 1995, Theor. Comput. Sci..
[218] Adrian Walker,et al. Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..
[219] Francesco M. Donini,et al. A Hybrid System with Datalog and Concept Languages , 1991, AI*IA.
[220] Mysore Ramaswamy,et al. Using Directed Hypergraphs to Verity Rule-Based Expert Systems , 1997, IEEE Trans. Knowl. Data Eng..
[221] Jens Dietrich,et al. A Rule-Based System for eCommerce Applications , 2004, KES.
[222] Jianhua Shao,et al. A Quality of Service Management Framework Based on User Expectations , 2003, ICSOC.
[223] Dieter Fensel,et al. The Web Service Modeling Framework WSMF , 2002, Electron. Commer. Res. Appl..
[224] Mathias Sallé. Service Management and IT Governance : Review , Comparative Analysis and their Impact on Utility Computing , .
[225] Michael J. Maher. Under consideration for publication in Theory and Practice of Logic Programming 1 Propositional Defeasible Logic has Linear Complexity , 2004 .
[226] Grigoris Antoniou,et al. Testing production system programs , 1998, Proceedings Ninth International Symposium on Software Reliability Engineering (Cat. No.98TB100257).
[227] V. S. Subrahmanian,et al. Dualities between alternative semantics for logic programming and nonmonotonic reasoning , 2004, Journal of Automated Reasoning.
[228] Victor W. Marek,et al. Autoepistemic logic , 1991, JACM.
[229] Hisao Tamaki,et al. OLD Resolution with Tabulation , 1986, ICLP.
[230] Maurice Bruynooghe,et al. Temporal Reasoning with Abductive Event Calculus , 1992, ECAI.
[231] Hartmut Ritter,et al. A concept for QoS integration in Web services , 2003, Fourth International Conference on Web Information Systems Engineering Workshops, 2003. Proceedings..
[232] Patrick Doherty,et al. Efficient Reasoning Using the Local Closed-World Assumption , 2000, AIMSA.
[233] Alexandra Poulovassilis,et al. RDFTL : An Event-Condition-Action Language for RDF , 2004 .
[234] Richard Denney. Test-case generation from Prolog-based specifications , 1991, IEEE Software.
[235] Jürgen Dix,et al. A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties , 1995, Fundam. Informaticae.
[236] Benjamin N. Grosof,et al. A courteous compiler from generalized courteous logic programs to ordinary logic programs , 1999 .
[237] Gopalan Nadathur,et al. Higher-Order Logic Programming , 1986, ICLP.
[238] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[239] Jennifer Widom,et al. Active Database Systems: Triggers and Rules For Advanced Database Processing , 1994 .
[240] James E. Tomberlin,et al. Introduction to deontic logic and the theory of normative systems , 1991 .
[241] Keith L. Clark,et al. Negation as Failure , 1987, Logic and Data Bases.
[242] José Júlio Alferes. Semantics of logic programs with explicit negation , 1993 .
[243] Gordon Plotkin,et al. A Note on Inductive Generalization , 2008 .
[244] Bijan Parsia,et al. Expressing WS Policies in OWL , 2005 .
[245] Kenneth Kunen,et al. Negation in Logic Programming , 1987, J. Log. Program..
[246] Benjamin N. Grosof,et al. A declarative approach to business rules in contracts: courteous logic programs in XML , 2015, EC '99.
[247] Roland Dietrich,et al. A Polymorphic Type System with Subtypes for Prolog , 1988, ESOP.
[248] Teodor C. Przymusinski. Perfect Model Semantics , 1988, ICLP/SLP.
[249] Henk Barendregt,et al. Introduction to Lambda Calculus , 1984 .
[250] Christine Collet,et al. Composite Events in NAOS , 1996, DEXA.
[251] Diego Calvanese,et al. Description Logics for Information Integration , 2002, Computational Logic: Logic Programming and Beyond.
[252] Kees Doets,et al. From logic to logic programming , 1994, Foundations of computing series.
[253] Adrian Paschke. RBSLA: Rule-based Service Level Agreements , 2007 .
[254] Christos H. Papadimitriou,et al. Why not negation by fixpoint? , 1988, PODS '88.
[255] José Júlio Alferes,et al. A logic programming system for nonmonotonic reasoning , 1995, Journal of Automated Reasoning.
[256] J. Cole,et al. On design and implementation of a contract monitoring facility , 2004, Proceedings. First IEEE International Workshop on Electronic Contracting, 2004..
[257] Jon R. Wright,et al. An Industrial-Strength Description-Logics-Based Configurator Platform , 1998, IEEE Intell. Syst..
[258] José Júlio Alferes,et al. Adding Closed World Assumptions to Well-Founded Semantics , 1994, Theor. Comput. Sci..
[259] Roland N. Bol,et al. Tabulated Resolution for the Well-Founded Semantics , 1993, J. Log. Program..
[260] Rodney W. Topor,et al. A Semantics for Typed Logic Programs , 1992, Types in Logic Programming.
[261] Adrian Paschke. RBSLA A declarative Rule-based Service Level Agreement Language based on RuleML , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).
[262] Hong Zhu,et al. Software unit test coverage and adequacy , 1997, ACM Comput. Surv..
[263] L. Thorne McCarty,et al. Permissions and Obligations , 1983, IJCAI.
[264] Alfonso Fuggetta,et al. Exploiting an event-based infrastructure to develop complex distributed systems , 1998, Proceedings of the 20th International Conference on Software Engineering.
[265] Alun Preece. Evaluating Verification and Validation Methods in Knowledge Engineering , 2001 .
[266] Harold Boley,et al. Object-Oriented RuleML: User-Level Roles, URI-Grounded Clauses, and Order-Sorted Terms , 2003, RuleML.
[267] Timos K. Sellis,et al. Coupling Production Systems and Database Systems: A Homogeneous Approach , 1993, IEEE Trans. Knowl. Data Eng..
[268] Victor Maojo,et al. Computer Algebra Based Verification and Knowledge Extraction in RBS - Application to Medical Fitness Criteria , 1999, EUROVAV.
[269] Michael J. Maher,et al. Embedding Defeasible Logic into Logic Programs , 2002, ICLP.
[270] Bertram Ludäscher,et al. On Logical Foundations of Active Databases , 1998, Logics for Databases and Information Systems.
[271] Lunjin Lu,et al. Polymorphic Type Analysis in Logic Programs by Abstract Intepretation , 1998, J. Log. Program..
[272] PerspectiveTeodor,et al. Non { monotonic Reasoning vs . Logic Programming : A New , 1987 .
[273] Ioana Manolescu,et al. Active XML: Peer-to-Peer Data and Web Services Integration , 2002, VLDB.
[274] David Billington,et al. Defeasible Logic is Stable , 1993, J. Log. Comput..
[275] Diego Calvanese,et al. Description Logics for Conceptual Data Modeling , 1998, Logics for Databases and Information Systems.
[276] David Scott Warren,et al. Efficient Top-Down Computation of Queries under the Well-Founded Semantics , 1995, J. Log. Program..
[277] Gobinda G. Chowdhury,et al. Spinning the Semantic Web: Bringing the World Wide Web to Its Full Potential , 2004 .
[278] Yong Hu,et al. Extended Well-Founded Model Semantics for General Logic Programs , 1991, ICLP.
[279] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..
[280] Michael J. Maher,et al. Efficient defeasible reasoning systems , 2000, Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000.
[281] Sarit Kraus,et al. Nonmonotonic Reasoning, Preferential Models and Cumulative Logics , 1990, Artif. Intell..
[282] Boris Motik,et al. Query Answering for OWL-DL with Rules , 2004, International Semantic Web Conference.
[283] Chitta Baral,et al. Logic Programming and Knowledge Representation , 1994, J. Log. Program..
[284] Enrico Giunchiglia,et al. An Action Language Based on Causal Explanation: Preliminary Report , 1998, AAAI/IAAI.
[285] Narain H. Gehani,et al. Event specification in an active object-oriented database , 1992, SIGMOD '92.
[286] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[287] Jorge Lobo,et al. Formal Characterization of Active Databases , 1996, Logic in Databases.
[288] Song Yuan Yan,et al. Foundations of declarative testing in arbitrary logic programming , 1990, Int. J. Comput. Math..
[289] Jos de Bruijn,et al. A Realistic Architecture for the Semantic Web , 2005, RuleML.
[290] Gerd Wagner,et al. Stable Model Theory for Extended RDF Ontologies , 2005, SEMWEB.
[291] Michael Thielscher,et al. From Situation Calculus to Fluent Calculus: State Update Axioms as a Solution to the Inferential Frame Problem , 1999, Artif. Intell..
[292] Emil C. Lupu,et al. The Ponder Policy Specification Language , 2001, POLICY.
[293] Aspassia Daskalopulu. Modelling legal contracts as processes , 2000, Proceedings 11th International Workshop on Database and Expert Systems Applications.
[294] Jorge Lobo,et al. A Logic Programming Approach to Conflict Resolution in Policy Management , 2000, KR.
[295] M. Shanahan. Solving the frame problem , 1997 .
[296] Lee Naish,et al. Types and the Intended Meaning of Logic Programs , 1992, Types in Logic Programming.
[297] Edmund Landau,et al. Foundations of analysis , 2001 .
[298] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[299] Robert A. Kowalski,et al. Amalgamating language and metalanguage in logic programming , 1982 .
[300] Sergio Greco,et al. Declarative semantics for active rules , 2001 .
[301] Shamim A. Naqvi,et al. Database updates in logic programming , 1988, PODS.
[302] di GenovaViale Causa. Action Languages, Temporal Action Logics and the Situation Calculus , 1999 .
[303] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..
[304] Michael J. Maher,et al. A Semantic Decomposition of Defeasible Logics , 1999, AAAI/IAAI.
[305] Robert A. Kowalski,et al. Database Updates in the Event Calculus , 1992, J. Log. Program..
[306] E. Sandewall. Features and fluents (vol. 1): the representation of knowledge about dynamical systems , 1995 .
[307] Jennifer Widom,et al. A denotational semantics for the Starburst production rule language , 1992, SGMD.
[308] Oren Etzioni,et al. Sound and Efficient Closed-World Reasoning for Planning , 1997, Artif. Intell..
[309] Asit Dan,et al. Business-to-business integration with tpaML and a business-to-business protocol framework , 2001, IBM Syst. J..
[310] James A. Hendler,et al. Semantic Web Architecture: Stack or Two Towers? , 2005, PPSWR.
[311] Michael J. Maher. A Model-Theoretic Semantics for Defeasible Logic , 2002, Paraconsistent Computational Logic.
[312] Michael Kifer,et al. Logical foundations of object-oriented and frame-based languages , 1995, JACM.
[313] Martin Huber,et al. Extended Prolog for Order-Sorted Resolution , 1987, SLP.
[314] Roberto Baldoni,et al. The evolution of publish/subscribe communication systems , 2003 .
[315] Radha Jagadeesan,et al. Timed Default Concurrent Constraint Programming , 1996, J. Symb. Comput..
[316] autoepistemic Zogic. Logic programming and negation : a survey , 2001 .
[317] Michael J. Maher. A Denotational Semantics of Defeasible Logic , 2000, Computational Logic.
[318] Vladimir Tosic,et al. Management applications of the Web Service Offerings Language (WSOL) , 2005, Inf. Syst..
[319] Hartmut Ehrig,et al. Equations and initial semantics , 1985 .
[320] A.D.H. Farrell,et al. Performance monitoring of service-level agreements for utility computing using the event calculus , 2004, Proceedings. First IEEE International Workshop on Electronic Contracting, 2004..
[321] Paolo Mancarella,et al. Production Systems with Negation as Failure , 2002, IEEE Trans. Knowl. Data Eng..
[322] William C. Chu,et al. A new approach to verify rule-based systems using Petri nets , 1999, Proceedings. Twenty-Third Annual International Computer Software and Applications Conference (Cat. No.99CB37032).