Kostas Stergiou

Orcid: 0000-0002-5702-9096

Affiliations:
  • University of Western Macedonia, Greece
  • University of the Aegean, Greece (former)
  • University of Strathclyde, Glasgow, UK (PhD 2001)


According to our database1, Kostas Stergiou authored at least 70 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Corrigendum to "Learning constraints through partial queries" [Artificial Intelligence 319 (2023) 103896].
Artif. Intell., March, 2024

A CP/LS Heuristic Method for Maxmin and Minmax Location Problems with Distance Constraints.
Proceedings of the 30th International Conference on Principles and Practice of Constraint Programming, 2024

2023
Learning constraints through partial queries.
Artif. Intell., June, 2023

The p-Dispersion Problem with Distance Constraints.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2022
Intelligent Pesticide and Irrigation Management in Precision Agriculture: The Case of VELOS Project.
Proceedings of the 10th International Conference on Information and Communication Technologies in Agriculture, 2022

2021
Adaptive constraint propagation in constraint satisfaction: review and evaluation.
Artif. Intell. Rev., 2021

MeAct: A Non-obstructive Persuasive End-to-End Platform for Active and Healthy Ageing Support.
Proceedings of the Mobile and Ubiquitous Systems: Computing, Networking and Services, 2021

Learning Max-CSPs via Active Constraint Acquisition.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020
Partial Queries for Constraint Acquisition.
CoRR, 2020

Efficient multiple constraint acquisition.
Constraints An Int. J., 2020

Omissions in Constraint Acquisition.
Proceedings of the Principles and Practice of Constraint Programming, 2020

2019
Neighborhood singleton consistencies.
Constraints An Int. J., 2019

Structure-Driven Multiple Constraint Acquisition.
Proceedings of the Principles and Practice of Constraint Programming, 2019

2018
Methods for Parallelizing Constraint Propagation through the Use of Strong Local Consistencies.
Int. J. Artif. Intell. Tools, 2018

Efficient Methods for Constraint Acquisition.
Proceedings of the Principles and Practice of Constraint Programming, 2018

2017
Exploiting the Pruning Power of Strong Local Consistencies Through Parallelization.
CoRR, 2017

Revisiting restricted path consistency.
Constraints An Int. J., 2017

Template matching of a coarse grain reconfigurable architecture datapath using constraint programming.
Proceedings of the 21st Pan-Hellenic Conference on Informatics, 2017

On Neighborhood Singleton Consistencies.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Strong local consistency algorithms for table constraints.
Constraints An Int. J., 2016

Using Parallelization to Efficiently Exploit the Pruning Power of Strong Local Consistencies.
Proceedings of the 9th Hellenic Conference on Artificial Intelligence, 2016

2015
Restricted Path Consistency Revisited.
Proceedings of the Principles and Practice of Constraint Programming, 2015

Strong Bounds Consistencies and Their Application to Linear Constraints.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Building Portfolios for Parallel Constraint Solving by Varying the Local Consistency Applied.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

2013
Extending STR to a Higher-Order Consistency.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Overlay networks for task allocation and coordination in large-scale networks of cooperative agents.
Auton. Agents Multi Agent Syst., 2012

Extending Generalized Arc Consistency.
Proceedings of the Artificial Intelligence: Theories and Applications, 2012

Evaluating Simple Fully Automated Heuristics for Adaptive Constraint Propagation.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

An Efficient Higher-Order Consistency Algorithm for Table Constraints.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
New algorithms for max restricted path consistency.
Constraints An Int. J., 2011

2010
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs.
Fundam. Informaticae, 2010

Experimental Evaluation of Branching Schemes for the CSP
CoRR, 2010

Conflict Directed Variable Selection Strategies for Constraint Satisfaction Problems.
Proceedings of the Artificial Intelligence: Theories, 2010

Adaptive Branching for Constraint Satisfaction Problems.
Proceedings of the ECAI 2010, 2010

Improving the Performance of maxRPC.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009
Introduction to the special issue on quantified CSPs and QBF.
Constraints An Int. J., 2009

Heuristics for dynamically adapting propagation in constraint satisfaction problems.
AI Commun., 2009

Learning How to Propagate Using Random Probing.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

2008
Strong Domain Filtering Consistencies for Non-Binary Constraint Satisfaction Problems.
Int. J. Artif. Intell. Tools, 2008

Preprocessing Quantified Constraint Satisfaction Problems with Value Reordering and Directional Arc and Path Consistency.
Int. J. Artif. Intell. Tools, 2008

Worst case examples of an exterior point algorithm for the assignment problem.
Discret. Optim., 2008

Solving quantified constraint satisfaction problems.
Artif. Intell., 2008

Domain filtering consistencies for non-binary constraints.
Artif. Intell., 2008

A Study of SAT-Based Branching Heuristics for the CSP.
Proceedings of the Artificial Intelligence: Theories, 2008

Experimental Evaluation of Modern Variable Selection Strategies in Constraint Satisfaction Problems.
Proceedings of the 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2008

Heuristics for Dynamically Adapting Propagation.
Proceedings of the ECAI 2008, 2008

2007
Strong Inverse Consistencies for Non-Binary CSPs.
Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

Solution Directed Backjumping for QCSP.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Overlay networks for task allocation and coordination in dynamic large-scale networks of cooperative agents.
Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

2006
Towards automatic merging of domain ontologies: The HCONE-merge approach.
J. Web Semant., 2006

Inverse Consistencies for Non-Binary Constraints.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Propagation in CSP and SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2006

Algorithms for Stochastic CSPs.
Proceedings of the Principles and Practice of Constraint Programming, 2006

2005
Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results.
J. Artif. Intell. Res., 2005

Fair Resource Allocation in a Simple Multi-agent Setting: Search Algorithms and Experimental Evaluation.
Int. J. Artif. Intell. Tools, 2005

QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Repair-Based Methods for Quantified CSPs.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Arc Consistency in Binary Encodings of Non-binary CSPs: Theoretical and Experimental Evaluation.
Proceedings of the Methods and Applications of Artificial Intelligence, 2004

Algorithms for Quantified Constraint Satisfaction Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2004

Constraint Satisfaction in Semi-structured Data Graphs.
Proceedings of the Principles and Practice of Constraint Programming, 2004

Capturing Semantics Towards Automatic Coordination of Domain Ontologies.
Proceedings of the Artificial Intelligence: Methodology, 2004

2002
On Algorithms for Decomposable Constraints.
Proceedings of the Methods and Applications of Artificial Intelligence, 2002

2001
Representation and reasoning with non-binary constraints.
PhD thesis, 2001

Solving Non-binary CSPs Using the Hidden Variable Encoding.
Proceedings of the Principles and Practice of Constraint Programming, 2001

2000
Backtracking algorithms for disjunctions of temporal constraints.
Artif. Intell., 2000

Decomposable constraints.
Artif. Intell., 2000

Singleton Consistencies.
Proceedings of the Principles and Practice of Constraint Programming, 2000

Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
The Difference All-Difference Makes.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

Encodings of Non-Binary Constraint Satisfaction Problems.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999


  Loading...