default search action
Camilla Schwind
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [p1]Thierry Boy de la Tour, Ricardo Caferra, Nicola Olivetti, Nicolas Peltier, Camilla Schwind:
Automated Deduction. A Guided Tour of Artificial Intelligence Research (2) (II) 2020: 53-81
2010 – 2019
- 2011
- [j20]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) - [c30]Camilla Schwind:
Belief Base Change on Implicant Sets: How to Give Up Elements of a Belief Based on Literal Level. CIS 2011: 239-243 - 2010
- [c29]Régis Alenda, Nicola Olivetti, Camilla Schwind, Dmitry Tishkovsky:
Tableau Calculi for CSL\mathcal{CSL} over minspaces. CSL 2010: 52-66 - [c28]Camilla Schwind:
From Inconsistency to Consistency: Knowledge Base Revision by Tableaux Opening. IBERAMIA 2010: 120-132
2000 – 2009
- 2009
- [j19]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): 21:1-21:50 (2009) - [c27]Régis Alenda, Nicola Olivetti, Camilla Schwind:
Comparative Concept Similarity over Minspaces: Axiomatisation and Tableaux Calculus. TABLEAUX 2009: 17-31 - [i4]Régis Alenda, Nicola Olivetti, Camilla Schwind:
Comparative concept similarity over Minspaces: Axiomatisation and Tableaux Calculus. CoRR abs/0902.0899 (2009) - 2008
- [c26]Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato, Camilla Schwind:
Non-Classical Logics for Knowledge Representation and Reasoning. Il Milione 2008 - 2007
- [j18]Laura Giordano
Specifying and verifying interaction protocols in a temporal action logic. J. Appl. Log. 5(2): 214-234 (2007) - [j17]Nicola Olivetti, Gian Luca Pozzato
A sequent calculus and a theorem prover for standard conditional logics. ACM Trans. Comput. Log. 8(4): 22 (2007) - [i3]Camilla Schwind:
A first-order Temporal Logic for Actions. CoRR abs/0705.1999 (2007) - 2005
- [c25]Laura Giordano
Specialization of Interaction Protocols in a Temporal Action Logic. LCMAS 2005: 3-22 - 2004
- [j16]Laura Giordano
Conditional logic of actions and causation. Artif. Intell. 157(1-2): 239-279 (2004) - [j15]Leopoldo E. Bertossi, Camilla Schwind:
Database Repairs and Analytic Tableaux. Ann. Math. Artif. Intell. 40(1-2): 5-35 (2004) - [c24]Laura Giordano, Alberto Martelli, Camilla Schwind:
Verifying Communicating Agents by Model Checking in a Temporal Action Logic. JELIA 2004: 57-69 - [i2]Nicola Olivetti, Gian Luca Pozzato, Camilla Schwind:
A Sequent Calculus and a Theorem Prover for Standard Conditional Logics. CoRR cs.LO/0407064 (2004) - 2003
- [c23]Laura Giordano, Alberto Martelli, Camilla Schwind:
Specifying and Verifying Systems of Communicating Agents in a Temporal Action Logic. AI*IA 2003: 262-274 - [c22]Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Camilla Schwind:
Tableau Calculi for Preference-Based Conditional Logics. TABLEAUX 2003: 81-101 - 2002
- [c21]Leopoldo E. Bertossi, Camilla Schwind:
Analytic Tableaux and Database Repairs: Foundations. FoIKS 2002: 32-48 - [c20]Laura Giordano, Camilla Schwind:
Towards a Conditional Logic of Actions and Causation. JELIA 2002: 382-393 - [c19]Laura Giordano, Camilla Schwind:
Towards a conditional logic of actions and causation. NMR 2002: 333-342 - [i1]Leopoldo E. Bertossi, Camilla Schwind:
Database Repairs and Analytic Tableaux. CoRR cs.DB/0211042 (2002) - 2001
- [j14]Laura Giordano, Alberto Martelli, Camilla Schwind:
Reasoning about Actions in Dynamic Linear Time Temporal Logic. Log. J. IGPL 9(2): 273-288 (2001) - [c18]Laura Giordano, Alberto Martelli, Camilla Schwind:
Reasoning about Actions in a Multiagent Domain. AI*IA 2001: 237-248 - [c17]Nicola Olivetti, Camilla Schwind:
A Calculus and Complexity Bound for Minimal Conditional Logic. ICTCS 2001: 384-404 - 2000
- [j13]Laura Giordano, Alberto Martelli, Camilla Schwind:
Ramification and causality in a modal action logic. J. Log. Comput. 10(5): 625-662 (2000)
1990 – 1999
- 1999
- [j12]Camilla Schwind:
Causality in Action Theories. Electron. Trans. Artif. Intell. 3(A): 27-50 (1999) - [c16]Camilla Schwind:
A Theory for Causal Reasoning. KI 1999: 285-288 - 1998
- [c15]Laura Giordano, Alberto Martelli, Camilla Schwind:
Dealing with Concurrent Actions in Modal Action Logics. ECAI 1998: 537-541 - 1997
- [j11]Philippe Chatalic, Christine Froidevaux, Camilla Schwind:
Graded Hypothesis Theories. Theor. Comput. Sci. 171(1-2): 247-280 (1997) - 1994
- [j10]Camilla Schwind, Pierre Siegel:
A Modal Logic for Hypothesis Theory. Fundam. Informaticae 21(1/2): 89-101 (1994) - [j9]Camilla Schwind:
Revision and action. Int. J. Intell. Syst. 9(1): 143-152 (1994) - [j8]Vincent Risch, Camilla Schwind:
Tableaux-Based Characterization and Theorem Proving for default Logic. J. Autom. Reason. 13(2): 223-242 (1994) - 1993
- [j7]Pierre Siegel, Camilla Schwind:
Modal logic based theory for non-monotonic reasoning. J. Appl. Non Class. Logics 3(1): 73-92 (1993) - 1992
- [c14]Vincent Risch, Camilla Schwind:
Tableaux-Based Theorem Proving and Non-Standard Reasoning. TABLEAUX 1992: 76-78 - 1991
- [c13]Camilla Schwind, Vincent Risch:
A Tableau-Based Characterisation for Default Logic. ECSQARU 1991: 310-317 - 1990
- [j6]Camilla Schwind:
Feature grammars for semantic analysis. Comput. Intell. 6: 172-178 (1990) - [j5]Camilla Schwind:
An Intelligent Language Tutoring System. Int. J. Man Mach. Stud. 33(5): 557-579 (1990) - [c12]Camilla Schwind:
A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic. CADE 1990: 528-542
1980 – 1989
- 1988
- [c11]Camilla Schwind:
Sensitive parsing: error analysis and explanation in an intelligent language tutoring system. COLING 1988: 608-613 - [c10]Emmanuel Lafon, Camilla Schwind:
A Theorem Prover for Action Performance. ECAI 1988: 541-546 - 1984
- [j4]Camilla Schwind:
Embedding deductive capabilities in relational database systems. Int. J. Parallel Program. 13(5): 327-338 (1984) - [c9]Camilla Schwind:
Semantikkonzepte in der Künstlichen Intelligenz. KIFS 1984: 94-158 - [c8]Camilla Schwind:
Temporal Logic in Artificial Intelligence. GWAI 1984: 238-264 - [c7]Camilla Schwind:
Logic Based Natural Language Processing. Natural Language Understanding and Natural Language Understanding Workshop 1984: 207-219 - 1983
- [j3]Camilla Schwind:
Semantic trees for natural language representation. Inf. Process. Manag. 19(4): 223-235 (1983) - 1982
- [c6]Camilla Schwind:
Natural Language Access to PROLOG Database Systems. GWAI 1982: 237-246
1970 – 1979
- 1978
- [c5]Camilla Schwind:
A Formalism for the Description of Question Answering Systems. Natural Language Communication with Computers 1978: 1-48 - [c4]Frank M. Brown, Camilla Schwind:
Analysing and Representing Natural Language in Logic. AISB/GI (ECAI) 1978: 66-70 - [c3]Camilla Schwind:
Representing Actions by State Logic. AISB/GI (ECAI) 1978: 304-308 - 1977
- [j2]Camilla Schwind, Jürgen M. Janas:
Automatic thesaurus construction from natural language definitions. SIGART Newsl. 61: 49-50 (1977) - [c2]Camilla Schwind:
A State Logic for the Representation of Natural Language Based Intelligent Systems. IJCAI 1977: 228 - 1976
- [j1]Stephan Braun, Camilla Schwind:
Automatic, semantics-based indexing of natural language texts for information retrieval systems. Inf. Process. Manag. 12(2): 147-153 (1976) - 1975
- [c1]Camilla Schwind:
Generating Hierarchical Semantic Networks Froma Natural Language Discourse. IJCAI 1975: 429-435
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-07 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: