RICERCA ITALIANA     

Programmi di ricerca simili:

• 1 - Future applicazioni del paradigma peer-to-peer
• 2 - Sintesi automatica di modelli astratti a partire da dati temporali o spaziali
• 3 - Metodi e strumenti per la migrazione di sistemi software verso architetture web e orientate ai servizi: valutazione sperimentale, usabilita' e trasferimento tecnologico
• 4 - Metodi numerici e grafici per l'analisi dei dati temporali
• 5 - Sistemi ad oggetti estendibili (EOS)
• 6 - Web Ram: web retrieval and mining
• 7 - AIDA2007 - Interpretazione Astratta: Progettazione e Applicazioni
• 8 - Metodi basati sulla similarita' per la visione artificiale e il riconoscimento delle forme: Teoria, algoritmi, applicazioni
• 9 - Sistemi a oggetti estendibili per ambienti dinamici e impredicibili (EOS DUE)
• 10 - Nuove tecniche e strumenti per l'interrogazione di servizi di ricerca su Web

Classificazione scientifico-disciplinare

• Area scientifico disciplinare: Scienze matematiche e informatiche
  • INFORMATICA

Classificazione brevettuale

• PHYSICS
  • COMPUTING; CALCULATING; COUNTING (score computers for games A63; combinations of writing applicances with computing devices B43K29/08)
    • ELECTRICAL DIGITAL DATA PROCESSING (computers in which a part of the computation is effected hydraulically or pneumatically G06D; optically G06E; self-contained input or output peripheral equipment G06K; impedance networks using digital techniques H03H) [C9603]

Classificazione geografica

• Regione: Calabria

Bibliografia

[1] C.Anger, K.Konczak, and T.Linke. NoMoRe: A System for Non-Monotonic Reasoning. Proc. of LPNMR'01, pp.406-410.
[2] K.Apt and M.Bezem. Acyclic programs. New Generation Computing, 9(3-4):335-365, 1991.
[3] K.Apt and N.Bol. Logic Programming and Negation: A Survey. Journal of Logic Programming, 19/20:9-71, 1994.
[4] M.Marchi, A.Mileo, A.Provetti. Declarative Policies for Web Service Selection. Proc. of POLICY 2005, pp.239-242.
[5] C.Baral. Knowledge representation, reasoning and declarative problem solving with Answer sets. Cambridge University Press, 2003.
[6] C.Baral and M.Gelfond. Logic Programming and Knowledge Representation. Journal of Logic Programming, 19/20:73-148, 1994.
[7] A.Behrend. Soft stratification for magic set based query evaluation in deductive databases. Proc. of ACM SIGMOD'03, pp.102-110.
[8] P.Bonatti. Prototypes for reasoning with infinite stable models and function symbols. Proc. of LPNMR'01, pp. 416-419.
[9] P.Bonatti. Reasoning with infinite stable models II: Disjunctive programs. Proc. of ICLP'02, pp. 333-346.
[10] P.Bonatti. Reasoning with infinite stable models. Artif. Intell., 156(1):75-111, 2004.
[11] S.Brass and J.Dix. A general Approach to Bottom-Up Computation of Disjunctive Semantics. Proc. of ICLP'94, pp.127-155.
[12] F.Buccafurri, W.Faber, and N.Leone. Disjunctive Logic Programs with Inheritance. Journal of the Theory and Practice of Logic Programming, 2(3), 2002.
[13] F.Buccafurri, N.Leone, and P.Rullo. Enhancing Disjunctive Datalog by Constraints. IEEE Transactions on Knowledge and Data Engineering, 12(5):845- 860, 2000.
[14] F.Calimeri, W.Faber, N.Leone, and G.Pfeifer. Pruning Operators for Answer Set Programming Systems. Proc. of NMR'02, pp.200-209.
[15] C.Cumbo, W.Faber, and G.Greco. Enhancing the magic-set method for disjunctive datalog programs. Proc. of ICLP'04.
[16] T.Dell'Armi, G.Ielpa, W.Faber, N.Leone, G.Pfeifer, Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in DLV. Proc. of IJCAI '03.
[17] M.Denecker, N.Pelov, and M.Bruynooghe. Ultimate Well-Founded and Stable Model Semantics for Logic Programs with Aggregates. Proc. of ICLP'01, pp.212-226.
[18] J.Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview. In Logic, Action and Information. Proc. of LogIn'92, pp.241-329.
[19] P.Doherty, W.Lukaszewicz, and A.Szalas. Computing circumscription revisited: A reduction algorithm. Journal of Automated Reasoning, 18(3):297-336, 1997.
[20] M.Marchi, A.Mileo, A.Provetti. Grid Service Selection with PPDL. Proc. of ICLP 2004, pp.464-466.
[21] T.Eiter, G.Gottlob, and H.Mannila. Disjunctive Datalog. ACM Transactions on Database Systems, 22(3):364-418, 1997.
[22] M.Gogolla, J.Bohling, and M.Richters. Validating UML and OCL Models in USE by Automatic Snapshot Generation. Journal on Software and System Modeling, 4(4):386-398, 2005.
[23] T.Eiter, N.Leone, C.Mateis, G.Pfeifer, and F.Scarcello. Progress Report on the Disjunctive Deductive Database System dlv. Proc. of FQAS'98, pp.148-163.
[24] W.Faber, G.Greco, and N.Leone. Magic sets and their application to data integration. Proc. of ICDT'05, pp.306-320.
[25] W.Faber, N.Leone, C.Mateis, and G.Pfeifer. Using Database Optimization Techniques for Nonmonotonic Reasoning. Proc. of DDLP'99, pp. 135-139.
[26] W.Faber, N.Leone, and G.Pfeifer. Pushing Goal Derivation in DLP Computations. Proc. of LPNMR'99, pp. 177-191.
[27] W.Faber, N.Leone, and G.Pfeifer. Experimenting with Heuristics for Answer Set Programming. Proc. of IJCAI'01, pp.635-640.
[28] W.Ahrendt et al. The KeY Tool, Software and System Modeling 4, pp.32-54, Springer, 2005.
[29] W.Faber, N.Leone, and G.Pfeifer. Recursive aggregates in disjunctive logic programs: Semantics and complexity. Proc. of JELIA'04, pp.200-212.
[30] F.Fages. Consistency of clark's completion and existence of stable models. Methods of Logic in Computer Science, 1:51-60, 1994.
[31] J.Fernandez and J.Minker. Bottom-Up Computation of Perfect Models for Disjunctive Theories. Journal of Logic Programming, 25(1):33-51, 1995.
[32] M.Marchi, A.Mileo, A.Provetti. Specification and Execution of Policies for Grid Service Selection. Proc. of ICWS04, pp.828-829.
[33] M.Gelfond and V.Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-385, 1991.
[34] S.Greco. Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries. IEEE Transactions on Knowledge and Data Engineering, 15(2):368-385, 2003.
[35] G.Ianni, G.Ielpa, A.Pietramala, and M.C.Santoro. Answer Set Programming with Templates. Proc. of ASP'03, pp.239-252.
[36] T.Janhunen, I.Niemela, D.Seipel, P.Simons, and J.-H. You. Unfolding Partiality and Disjunctions in Stable Model Semantics. Tech. Report cs.AI/0303009, arXiv.org, 2003.
[37] C.A.Johnson. Processing deductive databases under the disjunctive stable model semantics. Fundamenta Informaticae, 40(1):31-51, 1999.
[38] D.B.Kemp, D.Srivastava, and P.J.Stuckey. Bottom-up evaluation and query optimization of well-founded models. Theoretical Computer Science, 146:145- 184, 1995.
[39] D.B.Kemp and P.J.Stuckey. Semantics of Logic Programs with Aggregates. Proc. of ISLP'91, pp.387-401.
[40] UML 2.0 OCL Specification. http://www.omg.org/docs/ptc/03-10-14.pdf
[41] C.Koch, N.Leone, and G.Pfeifer. Enhancing Disjunctive Logic Programming Systems by SAT Checkers. Artificial Intelligence, 15(1-2):177-212, 2003.
[42] R.A.Kowalski. Predicate Logic as Programming Language. Computers for Artificial Intelligence Applications, 3:68-73, 1984.
[43] N.Leone, S.Perri, and F.Scarcello. Improving ASP Instantiators by Join-Ordering Methods. Proc. of LPNMR'01.
[44] N.Leone, P.Rullo, and F.Scarcello. Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation. Information and Computation, 135(2):69-112, 1997.
[45] Y.Lierler and M.Maratea. Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. Proc. of LPNMR'04, pp.346-350.
[46] V.Lifschitz. Computing circumscription. In Proceedings of IJCAI'85, pages 121-127, 1985.
[47] V.Lifschitz. Foundations of Logic Programming. Principles of Knowledge Representation, pp.69-127, 1996.
[48] V.Lifschitz, L.R. Tang, and H.Turner. Nested Expressions in Logic Programs. Annals of Mathematics and Artificial Intelligence, 25(3-4):369-389, 1999.
[49] F.Lin and Y.Zhao. ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. Proc. of AAAI'02.
[50] M.Ornaghi et al. A Constructive Modeling Language for Object Oriented Information Systems. Proc. of CLASE 2005.
[51] J.Lobo, J.Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, 1992.
[52] V.Marek and J.Remmel. On the expressibility of stable logic programming. Proc. of LPNMR'01, pp. 107-120.
[53] J.McCarthy. Circumscription: a form of nonmonotonic reasoning. Artificial Intelligence, 13:27-39, 1980.
[54] J.Minker. Overview of Disjunctive Logic Programming. Annals of Mathematics and Artificial Intelligence, 12:1-24, 1994.
[55] G.Gottlob and C.Koch. Monadic Datalog and the Expressive Power of Languages for Web Information Extraction. Journal of the ACM, vol 51.
[56] I.Niemela and P.Simons. Smodels - An Implementation of the Stable Model and Well-founded Semantics for Normal Logic Programs. Proc. of LPNMR'97, pp.420-429.
[57] N.Pelov and M.Truszczynski. Semantics of disjunctive programs with monotone aggregates - an operator-based approach. Proc. of NMR'04, pp.327-334.
[58] S.Perri and N.Leone. Parametric connectives in disjunctive logic programming. AI Communications, To appear.
[59] J.Dorn, P.Hrastnik, and A.Rainer. Web Service Discovery and Composition for Virtual Enterprises. Int.nal Journal of Web Services Research. To Appear.
[60] R.Reiter. A logic for default reasoning. Artificial Intelligence, 13:81-132, 1980.
[61] S.Baselice, P.A.Bonatti, M.Gelfond. Towards an Integration of Answer Set and Constraint Solving. Proc. of ICLP 2005, pp.52-66
[62] http://www.uml.org/#UML2.0

Parole Chiave

INF/01 - INFORMATICA, PROGRAMMAZIONE LOGICA DISGIUNTIVA, ANSWER SET PROGRAMMING, DATALOG, RAGIONAMENTO NON MONOTONO, LOGICA IN INTELLIGENZA ARTIFICIALE, RAPPRESENTAZIONE DELLA CONOSCENZA, ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI