Generating Hierarchical Semantic Networks Froma Natural Language Discourse. - Camilla Schwind (IJCAI, 1975)

Automatic, semantics-based indexing of natural language texts for information retrieval systems. - Stephan Braun; Camilla Schwind (Inf. Process. Manag., 1976)

A State Logic for the Representation of Natural Language Based Intelligent Systems. - Camilla Schwind (IJCAI, 1977)

Automatic thesaurus construction from natural language definitions. - Camilla Schwind; Jürgen M. Janas (SIGART Newsl., 1977)

A Formalism for the Description of Question Answering Systems. - Camilla Schwind (Natural Language Communication with Computers, 1978)

Analysing and Representing Natural Language in Logic. - Frank M. Brown; Camilla Schwind (AISB/GI (ECAI), 1978)

Representing Actions by State Logic. - Camilla Schwind (AISB/GI (ECAI), 1978)

Natural Language Access to PROLOG Database Systems. - Camilla Schwind (GWAI, 1982)

Semantic trees for natural language representation. - Camilla Schwind (Inf. Process. Manag., 1983)

Semantikkonzepte in der Künstlichen Intelligenz. - Camilla Schwind (KIFS, 1984)

Temporal Logic in Artificial Intelligence. - Camilla Schwind (GWAI, 1984)

Logic Based Natural Language Processing. - Camilla Schwind (Natural Language Understanding and Natural Language Understanding Workshop, 1984)

Embedding deductive capabilities in relational database systems. - Camilla Schwind (Int. J. Parallel Program., 1984)

Sensitive parsing: error analysis and explanation in an intelligent language tutoring system. - Camilla Schwind (COLING, 1988)

A Theorem Prover for Action Performance. - Emmanuel Lafon; Camilla Schwind (ECAI, 1988)

A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic. - Camilla Schwind (CADE, 1990)

Feature grammars for semantic analysis. - Camilla Schwind (Comput. Intell., 1990)

An Intelligent Language Tutoring System. - Camilla Schwind (Int. J. Man Mach. Stud., 1990)

A Tableau-Based Characterisation for Default Logic. - Camilla Schwind; Vincent Risch (ECSQARU, 1991)

Tableaux-Based Theorem Proving and Non-Standard Reasoning. - Vincent Risch; Camilla Schwind (TABLEAUX, 1992)

Modal logic based theory for non-monotonic reasoning. - Pierre Siegel; Camilla Schwind (J. Appl. Non Class. Logics, 1993)

A Modal Logic for Hypothesis Theory. - Camilla Schwind; Pierre Siegel (Fundam. Informaticae, 1994)

Revision and action. - Camilla Schwind (Int. J. Intell. Syst., 1994)

Tableaux-Based Characterization and Theorem Proving for default Logic. - Vincent Risch; Camilla Schwind (J. Autom. Reason., 1994)

Graded Hypothesis Theories. - Philippe Chatalic; Christine Froidevaux; Camilla Schwind (Theor. Comput. Sci., 1997)

Dealing with Concurrent Actions in Modal Action Logics. - Laura Giordano 001; Alberto Martelli; Camilla Schwind (ECAI, 1998)

A Theory for Causal Reasoning. - Camilla Schwind (KI, 1999)

Causality in Action Theories. - Camilla Schwind (Electron. Trans. Artif. Intell., 1999)

Ramification and causality in a modal action logic. - Laura Giordano 001; Alberto Martelli; Camilla Schwind (J. Log. Comput., 2000)

Reasoning about Actions in a Multiagent Domain. - Laura Giordano 001; Alberto Martelli; Camilla Schwind (AI*IA, 2001)

A Calculus and Complexity Bound for Minimal Conditional Logic. - Nicola Olivetti; Camilla Schwind (ICTCS, 2001)

Reasoning about Actions in Dynamic Linear Time Temporal Logic. - Laura Giordano 001; Alberto Martelli; Camilla Schwind (Log. J. IGPL, 2001)

Analytic Tableaux and Database Repairs: Foundations. - Leopoldo E. Bertossi; Camilla Schwind (FoIKS, 2002)

Towards a conditional logic of actions and causation. - Laura Giordano 001; Camilla Schwind (NMR, 2002)

Specifying and Verifying Systems of Communicating Agents in a Temporal Action Logic. - Laura Giordano 001; Alberto Martelli; Camilla Schwind (AI*IA, 2003)

Tableau Calculi for Preference-Based Conditional Logics. - Laura Giordano 001; Valentina Gliozzi; Nicola Olivetti; Camilla Schwind (TABLEAUX, 2003)

Verifying Communicating Agents by Model Checking in a Temporal Action Logic. - Laura Giordano 001; Alberto Martelli; Camilla Schwind (JELIA, 2004)

Conditional logic of actions and causation. - Laura Giordano 001; Camilla Schwind (Artif. Intell., 2004)

Database Repairs and Analytic Tableaux. - Leopoldo E. Bertossi; Camilla Schwind (Ann. Math. Artif. Intell., 2004)

Specialization of Interaction Protocols in a Temporal Action Logic. - Laura Giordano 001; Alberto Martelli; Camilla Schwind (LCMAS, 2005)

A first-order Temporal Logic for Actions - Camilla Schwind (CoRR, 2007)

Specifying and verifying interaction protocols in a temporal action logic. - Laura Giordano 001; Alberto Martelli; Camilla Schwind (J. Appl. Log., 2007)

A sequent calculus and a theorem prover for standard conditional logics. - Nicola Olivetti; Gian Luca Pozzato; Camilla Schwind (ACM Trans. Comput. Log., 2007)

Comparative Concept Similarity over Minspaces: Axiomatisation and Tableaux Calculus. - Régis Alenda; Nicola Olivetti; Camilla Schwind (TABLEAUX, 2009)

Tableau calculus for preference-based conditional logics: PCL and its extensions. - Laura Giordano 001; Valentina Gliozzi; Nicola Olivetti; Camilla Schwind (ACM Trans. Comput. Log., 2009)

Tableau Calculi for CSL mathcal{CSL} over minspaces. - Régis Alenda; Nicola Olivetti; Camilla Schwind; Dmitry Tishkovsky (CSL, 2010)

From Inconsistency to Consistency: Knowledge Base Revision by Tableaux Opening. - Camilla Schwind (IBERAMIA, 2010)

Belief Base Change on Implicant Sets: How to Give Up Elements of a Belief Based on Literal Level. - Camilla Schwind (CIS, 2011)

Non-classical logics for knowledge representation and reasoning. - Laura Giordano 001; Valentina Gliozzi; Nicola Olivetti; Gian Luca Pozzato; Camilla Schwind (Intelligenza Artificiale, 2011)

Automated Deduction. - Thierry Boy de la Tour; Ricardo Caferra; Nicola Olivetti; Nicolas Peltier; Camilla Schwind (A Guided Tour of Artificial Intelligence Research (2) (II), 2020)