Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints

Mathias Broxvall; Peter Jönsson; Jochen Renz

doi:10.1007/3-540-45349-0_10

ScienceGate Book Chapters

BOOK-CHAPTER

Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints

Mathias Broxvall Peter Jönsson Jochen Renz

Year: 2000 Lecture notes in computer science Pages: 114-127 Publisher: Springer Science+Business Media

DOI: 10.1007/3-540-45349-0_10

Get Full-Text PDF Get Analytical Report

Keywords:

Independence (probability theory) Computer science Correctness Simple (philosophy) Constraint satisfaction problem Constraint (computer-aided design) Property (philosophy) Consistency (knowledge bases) Constraint satisfaction Theoretical computer science Backtracking Algorithm Mathematical optimization Artificial intelligence Mathematics

Metrics

Cited By

1.20

FWCI (Field Weighted Citation Impact)

Refs

0.79

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Constraint Satisfaction and Optimization

Physical Sciences → Computer Science → Computer Networks and Communications

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Advanced Database Systems and Queries

Physical Sciences → Computer Science → Computer Networks and Communications

Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints

Metrics

Citation History

Topics

Related Documents

Tractable disjunctive constraints

Building tractable disjunctive constraints

More on tractable disjunctive Datalog

Tractable model discrimination for safety–critical systems with disjunctive and coupled constraints

Disjunctions, independence, refinements