default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Schwind
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c37]Nicolas Schwind, Katsumi Inoue, Sébastien Konieczny, Pierre Marquis
:
BeliefFlow: A Framework for Logic-Based Belief Diffusion via Iterated Belief Change. AAAI 2024: 10696-10704- [c36]Nerio Borges, Sébastien Konieczny, Ramón Pino Pérez, Nicolas Schwind:
Belief Change on Rational Rankings. KR 2024 - [c35]Elise Perrotin, Nicolas Schwind:
Relative Change-Reluctance in Iterated Belief Revision. PRICAI (5) 2024: 264-276 - 2023
- [j6]Nicolas Schwind, Emir Demirovic, Katsumi Inoue, Jean-Marie Lagniez:
Algorithms for partially robust team formation. Auton. Agents Multi Agent Syst. 37(2): 22 (2023) - [c34]Nicolas Schwind, Katsumi Inoue, Pierre Marquis:
Editing Boolean Classifiers: A Belief Change Perspective. AAAI 2023: 6516-6524 - [c33]Eduardo Fermé, Sébastien Konieczny, Ramón Pino Pérez, Nicolas Schwind:
Credible Models of Belief Update. KR 2023: 252-261 - [c32]Nicolas Schwind, Sébastien Konieczny, Ramón Pino Pérez:
Iteration of Iterated Belief Revision. KR 2023: 625-634 - 2022
- [c31]Nicolas Schwind, Sébastien Konieczny, Ramón Pino Pérez:
On Paraconsistent Belief Revision in LP. AAAI 2022: 5879-5887 - [c30]Zied Bouraoui, Sébastien Konieczny, Thanh Ma, Nicolas Schwind, Ivan Varzinczak:
Region-Based Merging of Open-Domain Terminological Knowledge. KR 2022 - [c29]Nicolas Schwind, Sébastien Konieczny, Ramón Pino Pérez:
On the Representation of Darwiche and Pearl's Epistemic States for Iterated Belief Revision. KR 2022 - [i2]Zied Bouraoui, Sébastien Konieczny, Thanh Ma, Nicolas Schwind, Ivan Varzinczak:
Region-Based Merging of Open-Domain Terminological Knowledge. CoRR abs/2205.02660 (2022) - 2021
- [j5]Nicolas Schwind, Tenda Okimoto, Katsumi Inoue, Katsutoshi Hirayama, Jean-Marie Lagniez, Pierre Marquis:
On the computation of probabilistic coalition structures. Auton. Agents Multi Agent Syst. 35(1): 14 (2021) - [c28]Nicolas Schwind, Emir Demirovic, Katsumi Inoue, Jean-Marie Lagniez:
Partial Robustness in Team Formation: Bridging the Gap between Robustness and Resilience. AAMAS 2021: 1154-1162 - 2020
- [c27]Emir Demirovic, Nicolas Schwind:
Representative Solutions for Bi-Objective Optimisation. AAAI 2020: 1436-1443 - [c26]Nicolas Schwind, Sébastien Konieczny, Jean-Marie Lagniez, Pierre Marquis:
On Computational Aspects of Iterated Belief Change. IJCAI 2020: 1770-1776 - [c25]Nicolas Schwind, Sébastien Konieczny:
Non-Prioritized Iterated Revision: Improvement via Incremental Belief Merging. KR 2020: 738-747
2010 – 2019
- 2019
- [c24]Nicolas Schwind, Katsumi Inoue, Sébastien Konieczny, Jean-Marie Lagniez, Pierre Marquis:
What Has Been Said? Identifying the Change Formula in a Belief Revision Scenario. IJCAI 2019: 1865-1871 - [c23]Gauvain Bourgne, Yutaro Totsuka, Nicolas Schwind, Katsumi Inoue:
Identifying Belief Sequences in a Network of Communicating Agents. PRIMA 2019: 370-386 - 2018
- [j4]Nicolas Schwind, Sébastien Konieczny, Pierre Marquis:
Belief base rationalization for propositional merging. J. Log. Comput. 28(7): 1601-1634 (2018) - [c22]Nicolas Schwind, Pierre Marquis:
On Consensus in Belief Merging. AAAI 2018: 1949-1956 - [c21]Emir Demirovic, Nicolas Schwind, Tenda Okimoto, Katsumi Inoue:
Recoverable Team Formation: Building Teams Resilient to Change. AAMAS 2018: 1362-1370 - [c20]Nicolas Schwind, Sébastien Konieczny, Pierre Marquis:
On Belief Promotion. KR 2018: 297-307 - [c19]Nicolas Schwind, Tenda Okimoto, Katsumi Inoue, Katsutoshi Hirayama, Jean-Marie Lagniez, Pierre Marquis:
Probabilistic Coalition Structure Generation. KR 2018: 663-664 - [c18]Tenda Okimoto, Nicolas Schwind, Emir Demirovic, Katsumi Inoue, Pierre Marquis:
Robust Coalition Structure Generation. PRIMA 2018: 140-157 - [e1]Manasawee Kaenampornpan, Rainer Malaka, Duc Dung Nguyen, Nicolas Schwind:
Multi-disciplinary Trends in Artificial Intelligence - 12th International Conference, MIWAI 2018, Hanoi, Vietnam, November 18-20, 2018, Proceedings. Lecture Notes in Computer Science 11248, Springer 2018, ISBN 978-3-030-03013-1 [contents] - 2016
- [j3]Nicolas Schwind, Morgan Magnin, Katsumi Inoue, Tenda Okimoto, Taisuke Sato, Kazuhiro Minami, Hiroshi Maruyama:
Formalization of resilience for constraint-based dynamic systems. J. Reliab. Intell. Environ. 2(1): 17-35 (2016) - [j2]Nicolas Schwind, Katsumi Inoue:
Characterization of logic program revision as an extension of propositional revision. Theory Pract. Log. Program. 16(1): 111-138 (2016) - [c17]Nicolas Schwind, Katsumi Inoue, Gauvain Bourgne, Sébastien Konieczny, Pierre Marquis:
Is Promoting Beliefs Useful to Make Them Accepted in Networks of Agents?. IJCAI 2016: 1237-1243 - [c16]Nicolas Schwind, Tenda Okimoto, Maxime Clement, Katsumi Inoue:
Representative Solutions for Multi-Objective Constraint Optimization Problems. KR 2016: 601-604 - 2015
- [c15]Nicolas Schwind, Katsumi Inoue, Gauvain Bourgne, Sébastien Konieczny, Pierre Marquis:
Belief Revision Games. AAAI 2015: 1590-1596 - [c14]Tenda Okimoto, Nicolas Schwind, Maxime Clement, Tony Ribeiro, Katsumi Inoue, Pierre Marquis:
How to Form a Task-Oriented Robust Team. AAMAS 2015: 395-403 - [c13]Maxime Clement, Tenda Okimoto, Nicolas Schwind, Katsumi Inoue:
Finding Resilient Solutions for Dynamic Multi-Objective Constraint Optimization Problems. ICAART (2) 2015: 509-516 - [i1]Nicolas Schwind, Katsumi Inoue:
Characterization of Logic Program Revision as an Extension of Propositional Revision. CoRR abs/1506.08919 (2015) - 2014
- [j1]Pierre Marquis, Nicolas Schwind:
Lost in translation: Language independence in propositional logic - application to belief change. Artif. Intell. 206: 1-24 (2014) - [c12]Tenda Okimoto, Nicolas Schwind, Maxime Clement, Katsumi Inoue:
Lp-Norm based algorithm for multi-objective distributed constraint optimization. AAMAS 2014: 1427-1428 - [c11]Nicolas Schwind, Tenda Okimoto, Sébastien Konieczny, Maxime Wack, Katsumi Inoue:
Utilitarian and Egalitarian Solutions for Multi-objective Constraint Optimization. ICTAI 2014: 170-177 - 2013
- [c10]Nicolas Schwind, Tenda Okimoto, Katsumi Inoue, Hei Chan, Tony Ribeiro, Kazuhiro Minami, Hiroshi Maruyama:
Systems resilience: a challenge problem for dynamic constraint-based agent systems. AAMAS 2013: 785-788 - [c9]Nicolas Schwind, Katsumi Inoue:
Characterization Theorems for Revision of Logic Programs. LPNMR 2013: 485-498 - 2011
- [c8]Sébastien Konieczny, Pierre Marquis, Nicolas Schwind:
Belief Base Rationalization for Propositional Merging. IJCAI 2011: 951-956 - [c7]Pierre Marquis, Nicolas Schwind:
Lost in Translation: Language Independence in Propositional Logic - Application to Belief Revision and Belief Merging. IJCAI 2011: 1002-1007 - 2010
- [c6]Jean-François Condotta, Souhila Kaci, Pierre Marquis, Nicolas Schwind:
Majority Merging: from Boolean Spaces to Affine Spaces. ECAI 2010: 627-632 - [c5]Jean-François Condotta, Souhila Kaci, Pierre Marquis, Nicolas Schwind:
A Syntactical Approach to Qualitative Constraint Networks Merging. LPAR (Yogyakarta) 2010: 233-247
2000 – 2009
- 2009
- [c4]Jean-François Condotta, Souhila Kaci, Pierre Marquis, Nicolas Schwind:
Merging Qualitative Constraint Networks Defined on Different Qualitative Formalisms. COSIT 2009: 106-123 - [c3]Jean-François Condotta, Souhila Kaci, Pierre Marquis, Nicolas Schwind:
Merging Qualitative Constraints Networks Using Propositional Logic. ECSQARU 2009: 347-358 - [c2]Jean-François Condotta, Souhila Kaci, Pierre Marquis, Nicolas Schwind:
Merging Qualitative Constraint Networks in a Piecewise Fashion. ICTAI 2009: 605-608 - 2008
- [c1]Jean-François Condotta, Souhila Kaci, Nicolas Schwind:
A Framework for Merging Qualitative Constraints Networks. FLAIRS 2008: 586-591
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-12-23 20:31 CET 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:
