Constraints

ISSN: 1383-7133

Journal Home

Journal Guideline

Constraints Q2 Unclaimed

Springer Netherlands Netherlands
Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

This journal provides a common forum for the many disciplines interested in constraint programming and constraint satisfaction and optimization, and the many application domains in which constraint technology is employed. It covers all aspects of computing with constraints, including: theory and practice, algorithms and systems, reasoning and programming, logics and languages. Relevant disciplines and application domains include, but are not limited to: Disciplines: artificial intelligence, automated reasoning, combinatorial algorithms, databases, discrete mathematics, operations research, programming languages, satisfiability and computational logic. Domains: agents, bioinformatics, design and configuration, graphics, visualization, user interfaces, human-computer interaction and decision support, robotics, machine vision and computational linguistics, scheduling, planning, resource allocation, temporal and spatial reasoning. Officially cited as: Constraints Covers all aspects of computing with constraints, including: theory and practice, algorithms and systems, reasoning and programming, logics and languages. An international forum for the many disciplines interested in constraint programming and constraint satisfaction and optimization. It has an SJR impact factor of 0,586.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Metrics

Constraints

0,586

SJR Impact factor

48

H Index

20

Total Docs (Last Year)

32

Total Docs (3 years)

862

Total Refs

50

Total Cites (3 years)

28

Citable Docs (3 years)

1.21

Cites/Doc (2 years)

43.1

Ref/Doc

Comments

No comments ... Be the first to comment!



Best articles by citations

Maintaining Longest Paths Incrementally

View more

Periodic Constraint Satisfaction Problems: Tractable Subclasses

View more

On Benchmarking Constraint Logic Programming Platforms. Response to Fernandez and Hill's "A Comparative Study of Eight Constraint Programming Languages over the Boolean and Finite Domains"

View more

Implementing a Test for Tractability

View more

A General Qualitative Framework for Temporal and Spatial Reasoning

View more

A Comparison between SAT and CSP Techniques

View more

FAQS