| 2011 | ||
|---|---|---|
| 51 | Camilla Schwind: Belief Base Change on Implicant Sets: How to Give Up Elements of a Belief Based on Literal Level. CIS 2011: 239-243 | |
| 50 | Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato, Camilla Schwind: Non-classical logics for knowledge representation and reasoning. Intelligenza Artificiale 5(1): 127-131 (2011) | |
| 2010 | ||
| 49 | Régis Alenda, Nicola Olivetti, Camilla Schwind, Dmitry Tishkovsky: Tableau Calculi for CSL\mathcal{CSL} over minspaces. CSL 2010: 52-66 | |
| 48 | Camilla Schwind: From Inconsistency to Consistency: Knowledge Base Revision by Tableaux Opening. IBERAMIA 2010: 120-132 | |
| 2009 | ||
| 47 | Régis Alenda, Nicola Olivetti, Camilla Schwind: Comparative Concept Similarity over Minspaces: Axiomatisation and Tableaux Calculus. TABLEAUX 2009: 17-31 | |
| 46 | Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Camilla Schwind: Tableau calculus for preference-based conditional logics: PCL and its extensions. ACM Trans. Comput. Log. 10(3): (2009) | |
| 45 | Régis Alenda, Nicola Olivetti, Camilla Schwind: Comparative concept similarity over Minspaces: Axiomatisation and Tableaux Calculus CoRR abs/0902.0899: (2009) | |
| 2007 | ||
| 44 | Nicola Olivetti, Gian Luca Pozzato, Camilla Schwind: A sequent calculus and a theorem prover for standard conditional logics. ACM Trans. Comput. Log. 8(4): (2007) | |
| 43 | Camilla Schwind: A first-order Temporal Logic for Actions CoRR abs/0705.1999: (2007) | |
| 42 | Laura Giordano, Alberto Martelli, Camilla Schwind: Specifying and verifying interaction protocols in a temporal action logic. J. Applied Logic 5(2): 214-234 (2007) | |
| 2006 | ||
| 41 | Laura Giordano, Alberto Martelli, Camilla Schwind: Specialization of Interaction Protocols in a Temporal Action Logic. Electr. Notes Theor. Comput. Sci. 157(4): 3-22 (2006) | |
| 2004 | ||
| 40 | Laura Giordano, Alberto Martelli, Camilla Schwind: Verifying Communicating Agents by Model Checking in a Temporal Action Logic. JELIA 2004: 57-69 | |
| 39 | Leopoldo E. Bertossi, Camilla Schwind: Database Repairs and Analytic Tableaux. Ann. Math. Artif. Intell. 40(1-2): 5-35 (2004) | |
| 38 | Laura Giordano, Camilla Schwind: Conditional logic of actions and causation. Artif. Intell. 157(1-2): 239-279 (2004) | |
| 37 | Nicola Olivetti, Gian Luca Pozzato, Camilla Schwind: A Sequent Calculus and a Theorem Prover for Standard Conditional Logics CoRR cs.LO/0407064: (2004) | |
| 2003 | ||
| 36 | Laura Giordano, Alberto Martelli, Camilla Schwind: Specifying and Verifying Systems of Communicating Agents in a Temporal Action Logic. AI*IA 2003: 262-274 | |
| 35 | Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Camilla Schwind: Tableau Calculi for Preference-Based Conditional Logics. TABLEAUX 2003: 81-101 | |
| 2002 | ||
| 34 | Leopoldo E. Bertossi, Camilla Schwind: Analytic Tableaux and Database Repairs: Foundations. FoIKS 2002: 32-48 | |
| 33 | Laura Giordano, Camilla Schwind: Towards a Conditional Logic of Actions and Causation. JELIA 2002: 382-393 | |
| 32 | Laura Giordano, Camilla Schwind: Towards a conditional logic of actions and causation. NMR 2002: 333-342 | |
| 31 | Leopoldo E. Bertossi, Camilla Schwind: Database Repairs and Analytic Tableaux CoRR cs.DB/0211042: (2002) | |
| 2001 | ||
| 30 | Laura Giordano, Alberto Martelli, Camilla Schwind: Reasoning about Actions in a Multiagent Domain. AI*IA 2001: 237-248 | |
| 29 | Nicola Olivetti, Camilla Schwind: A Calculus and Complexity Bound for Minimal Conditional Logic. ICTCS 2001: 384-404 | |
| 28 | Laura Giordano, Alberto Martelli, Camilla Schwind: Reasoning about Actions in Dynamic Linear Time Temporal Logic. Logic Journal of the IGPL 9(2): 273-288 (2001) | |
| 2000 | ||
| 27 | Laura Giordano, Alberto Martelli, Camilla Schwind: Ramification and causality in a modal action logic. J. Log. Comput. 10(5): 625-662 (2000) | |
| 1999 | ||
| 26 | Camilla Schwind: A Theory for Causal Reasoning. KI 1999: 285-288 | |
| 25 | Camilla Schwind: Causality in Action Theories. Electron. Trans. Artif. Intell. 3(A): 27-50 (1999) | |
| 1998 | ||
| 24 | Laura Giordano, Alberto Martelli, Camilla Schwind: Dealing with Concurrent Actions in Modal Action Logics. ECAI 1998: 537-541 | |
| 1997 | ||
| 23 | Philippe Chatalic, Christine Froidevaux, Camilla Schwind: Graded Hypothesis Theories. Theor. Comput. Sci. 171(1-2): 247-280 (1997) | |
| 1994 | ||
| 22 | Camilla Schwind, Pierre Siegel: A Modal Logic for Hypothesis Theory. Fundam. Inform. 21(1/2): 89-101 (1994) | |
| 21 | Vincent Risch, Camilla Schwind: Tableaux-Based Characterization and Theorem Proving for default Logic. J. Autom. Reasoning 13(2): 223-242 (1994) | |
| 1993 | ||
| 20 | Pierre Siegel, Camilla Schwind: Modal logic based theory for non-monotonic reasoning. Journal of Applied Non-Classical Logics 3(1): (1993) | |
| 1992 | ||
| 19 | Vincent Risch, Camilla Schwind: Tableaux-Based Theorem Proving and Non-Standard Reasoning. TABLEAUX 1992: 76-78 | |
| 1991 | ||
| 18 | Camilla Schwind, Vincent Risch: A Tableau-Based Characterisation for Default Logic. ECSQARU 1991: 310-317 | |
| 1990 | ||
| 17 | Camilla Schwind: A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic. CADE 1990: 528-542 | |
| 16 | Camilla Schwind: Feature grammars for semantic analysis. Computational Intelligence 6: 172-178 (1990) | |
| 15 | Camilla Schwind: An Intelligent Language Tutoring System. International Journal of Man-Machine Studies 33(5): 557-579 (1990) | |
| 1988 | ||
| 14 | Camilla Schwind: Sensitive parsing: error analysis and explanation in an intelligent language tutoring system. COLING 1988: 608-613 | |
| 13 | Emmanuel Lafon, Camilla Schwind: A Theorem Prover for Action Performance. ECAI 1988: 541-546 | |
| 1984 | ||
| 12 | Camilla Schwind: Temporal Logic in Artificial Intelligence. GWAI 1984: 238-264 | |
| 11 | Camilla Schwind: Semantikkonzepte in der Künstlichen Intelligenz. KIFS 1984: 94-158 | |
| 10 | Camilla Schwind: Logic Based Natural Language Processing. Natural Language Understanding and Natural Language Understanding Workshop 1984: 207-219 | |
| 9 | Camilla Schwind: Embedding deductive capabilities in relational database systems. International Journal of Parallel Programming 13(5): 327-338 (1984) | |
| 1983 | ||
| 8 | Camilla Schwind: Semantic trees for natural language representation. Inf. Process. Manage. 19(4): 223-235 (1983) | |
| 1982 | ||
| 7 | Camilla Schwind: Natural Language Access to PROLOG Database Systems. GWAI 1982: 237-246 | |
| 1978 | ||
| 6 | Camilla Schwind: Representing Actions by State Logic. AISB/GI (ECAI) 1978: 304-308 | |
| 5 | Frank M. Brown, Camilla Schwind: Analysing and Representing Natural Language in Logic. AISB/GI (ECAI) 1978: 66-70 | |
| 4 | Camilla Schwind: A Formalism for the Description of Question Answering Systems. Natural Language Communication with Computers 1978: 1-48 | |
| 1977 | ||
| 3 | Camilla Schwind: A State Logic for the Representation of Natural Language Based Intelligent Systems. IJCAI 1977: 228 | |
| 1976 | ||
| 2 | Stephan Braun, Camilla Schwind: Automatic, semantics-based indexing of natural language texts for information retrieval systems. Inf. Process. Manage. 12(2): 147-153 (1976) | |
| 1975 | ||
| 1 | Camilla Schwind: Generating Hierarchical Semantic Networks Froma Natural Language Discourse. IJCAI 1975: 429-435 | |
| 1 | Régis Alenda | [45] [47] [49] |
| 2 | Leopoldo E. Bertossi | [31] [34] [39] |
| 3 | Stephan Braun | [2] |
| 4 | Frank M. Brown | [5] |
| 5 | Philippe Chatalic | [23] |
| 6 | Christine Froidevaux | [23] |
| 7 | Laura Giordano | [24] [27] [28] [30] [32] [33] [35] [36] [38] [40] [41] [42] [46] [50] |
| 8 | Valentina Gliozzi | [35] [46] [50] |
| 9 | Emmanuel Lafon | [13] |
| 10 | Alberto Martelli | [24] [27] [28] [30] [36] [40] [41] [42] |
| 11 | Nicola Olivetti | [29] [35] [37] [44] [45] [46] [47] [49] [50] |
| 12 | Gian Luca Pozzato | [37] [44] [50] |
| 13 | Vincent Risch | [18] [19] [21] |
| 14 | Pierre Siegel | [20] [22] |
| 15 | Dmitry Tishkovsky | [49] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page