2 Search Results for "Long, Zhiguo"


Document
CSPs with Few Alien Constraints

Authors: Peter Jonsson, Victor Lagerkvist, and George Osipov

Published in: LIPIcs, Volume 307, 30th International Conference on Principles and Practice of Constraint Programming (CP 2024)


Abstract
The constraint satisfaction problem asks to decide if a set of constraints over a relational structure 𝒜 is satisfiable (CSP(𝒜)). We consider CSP(𝒜 ∪ ℬ) where 𝒜 is a structure and ℬ is an alien structure, and analyse its (parameterized) complexity when at most k alien constraints are allowed. We establish connections and obtain transferable complexity results to several well-studied problems that previously escaped classification attempts. Our novel approach, utilizing logical and algebraic methods, yields an FPT versus pNP dichotomy for arbitrary finite structures and sharper dichotomies for Boolean structures and first-order reducts of (ℕ, =) (equality CSPs), together with many partial results for general ω-categorical structures.

Cite as

Peter Jonsson, Victor Lagerkvist, and George Osipov. CSPs with Few Alien Constraints. In 30th International Conference on Principles and Practice of Constraint Programming (CP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 307, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)


Copy BibTex To Clipboard

@InProceedings{jonsson_et_al:LIPIcs.CP.2024.15,
  author =	{Jonsson, Peter and Lagerkvist, Victor and Osipov, George},
  title =	{{CSPs with Few Alien Constraints}},
  booktitle =	{30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
  pages =	{15:1--15:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-336-2},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{307},
  editor =	{Shaw, Paul},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.15},
  URN =		{urn:nbn:de:0030-drops-207005},
  doi =		{10.4230/LIPIcs.CP.2024.15},
  annote =	{Keywords: Constraint satisfaction, parameterized complexity, hybrid theories}
}
Document
An Incremental Algorithm for Handling Qualitative Spatio-Temporal Information

Authors: Zhiguo Long, Qiyuan Hu, Hua Meng, and Michael Sioutis

Published in: LIPIcs, Volume 240, 15th International Conference on Spatial Information Theory (COSIT 2022)


Abstract
In this paper, we present an online (incremental) algorithm for checking the satisfiability of qualitative spatio-temporal data, with direct implications to other fundamental knowledge representation and reasoning problems for such data, like the problems of deductive closure and redundancy removal. In particular, qualitative data come in the form of human-like, symbolic, descriptions such as "region x contains or overlaps region y", which are abundant in the Web of Data. Our approach is also able to maintain, to some extent, any sparse graph structure that may be inherent in the data, i.e., it acts parsimoniously and only tries to infer new information when needed for soundness and completeness. To this end, we complement our practical algorithm with certain theoretical results to assert its correctness and efficiency. A subsequent evaluation with publicly available large-scale real-world and random datasets against the state of the art, shows the interest and promise of our method.

Cite as

Zhiguo Long, Qiyuan Hu, Hua Meng, and Michael Sioutis. An Incremental Algorithm for Handling Qualitative Spatio-Temporal Information. In 15th International Conference on Spatial Information Theory (COSIT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 240, pp. 5:1-5:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


Copy BibTex To Clipboard

@InProceedings{long_et_al:LIPIcs.COSIT.2022.5,
  author =	{Long, Zhiguo and Hu, Qiyuan and Meng, Hua and Sioutis, Michael},
  title =	{{An Incremental Algorithm for Handling Qualitative Spatio-Temporal Information}},
  booktitle =	{15th International Conference on Spatial Information Theory (COSIT 2022)},
  pages =	{5:1--5:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-257-0},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{240},
  editor =	{Ishikawa, Toru and Fabrikant, Sara Irina and Winter, Stephan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.COSIT.2022.5},
  URN =		{urn:nbn:de:0030-drops-168907},
  doi =		{10.4230/LIPIcs.COSIT.2022.5},
  annote =	{Keywords: Online algorithm, qualitative data, spatio-temporal reasoning, satisfiability checking, knowledge representation and reasoning}
}
  • Refine by Author
  • 1 Hu, Qiyuan
  • 1 Jonsson, Peter
  • 1 Lagerkvist, Victor
  • 1 Long, Zhiguo
  • 1 Meng, Hua
  • Show More...

  • Refine by Classification
  • 1 Computing methodologies → Spatial and physical reasoning
  • 1 Computing methodologies → Temporal reasoning
  • 1 Mathematics of computing → Discrete mathematics
  • 1 Theory of computation → Complexity theory and logic
  • 1 Theory of computation → Constraint and logic programming

  • Refine by Keyword
  • 1 Constraint satisfaction
  • 1 Online algorithm
  • 1 hybrid theories
  • 1 knowledge representation and reasoning
  • 1 parameterized complexity
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2022
  • 1 2024

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail