Results 61 to 70 of about 5,971,608 (284)
Cores of Countably Categorical Structures [PDF]
Logical Methods in Computer Science, 2007 A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems.
Manuel Bodirsky
doaj +1 more source
Algorithms, 2022 In configuration design, the task is to compose a system out of a set of predefined, modu-lar building blocks assembled by defined interfaces. Product configuration systems, both with or without integration of geometric models, implement reasoning ...
Paul Christoph Gembarski
doaj +1 more source
Proceedings of the 11th International Conference on Agents and Artificial Intelligence, 2019 This paper describes a new approach on optimization of regular constraint satisfaction problems (rCSPs) using an auxiliary constraint satisfaction optimization problem (CSOP) that detects areas with a potentially high number of conflicts. The purpose of this approach is to remove conflicts by the combination of regular constraints with intersection and
Sven Löffler +2 more
openaire +1 more source
Advanced Engineering Materials, EarlyView.Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari +5 more
wiley +1 more source
Constraint Satisfaction Problems over Numeric Domains [PDF]
, 2017 We present a survey of complexity results for constraint satisfaction problems (CSPs) over the integers, the rationals, the reals, and the complex numbers.
Mamino, Marcello, Bodirsky, Manuel
core +1 more source
Solving finite-domain linear constraints in presence of the $\texttt{alldifferent}$ [PDF]
Logical Methods in Computer Science, 2017 In this paper, we investigate the possibility of improvement of the widely-used filtering algorithm for the linear constraints in constraint satisfaction problems in the presence of the alldifferent constraints. In many cases, the fact that the variables
Milan Banković
doaj +1 more source
Caterpillar Duality for Constraint Satisfaction Problems [PDF]
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008 The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems that are definable in the smallest natural recursive fragment of Datalog - monadic linear Datalog with at most one EDB per rule.
Catarina Carvalho +2 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Digitalizing electroplating requires both domain knowledge and interoperability. This work introduces PlatOn, a domain ontology for trivalent chromium plating and coating characterization, and a hybrid pipeline that aligns it to a mid‐level reference ontology by combining eight similarity metrics with language model reasoning. Expert‐validated mappings
Janik Harter +10 more
wiley +1 more source
An improved constraint satisfaction adaptive neural network for job-shop scheduling [PDF]
, 2010 Copyright @ Springer Science + Business Media, LLC 2009This paper presents an improved constraint satisfaction adaptive neural network for job-shop scheduling problems.
Yang, S +11 more
core +1 more source
Constraint models for complex state transitions
Computer Assisted Methods in Engineering and Science, 2022 Constraint-based scheduling is an approach for solving real-life scheduling problems by combining the generality of AI techniques with the efficiency of OR techniques. Basically, it describes a scheduling problem as a constraint satisfaction problem and
Roman Bartak
doaj