About: AC-3 algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: AC-3 algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatAlgorithms, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FAC-3_algorithm

In constraint satisfaction, the AC-3 algorithm (short for Arc Consistency Algorithm #3) is one of a series of algorithms used for the solution of constraint satisfaction problems (or CSP's). It was developed by Alan Mackworth in 1977. The earlier AC algorithms are often considered too inefficient, and many of the later ones are difficult to implement, and so AC-3 is the one most often taught and used in very simple constraint solvers.

Attributes	Values
rdf:type	yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Event100029378 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity television show yago:Rule105846932 yago:WikicatAlgorithms
rdfs:label	AC-3-Algorithmus (de) AC-3 algorithm (en) AC-3 알고리즘 (ko) Алгоритм AC-3 (uk)
rdfs:comment	In constraint satisfaction, the AC-3 algorithm (short for Arc Consistency Algorithm #3) is one of a series of algorithms used for the solution of constraint satisfaction problems (or CSP's). It was developed by Alan Mackworth in 1977. The earlier AC algorithms are often considered too inefficient, and many of the later ones are difficult to implement, and so AC-3 is the one most often taught and used in very simple constraint solvers. (en) Der AC-3-Algorithmus (von englisch arc consistency algorithm, dt.: Kantenkonsistenz-Algorithmus) ist ein Algorithmus zur Lösung von Constraint-Erfüllungsproblemen (CSPs) mit binären Bedingungen. Er wurde 1977 von entwickelt. (de) ( 이 문서는 제약 만족 문제에 관한 것입니다. AC-3 오디오 코덱에 대해서는 돌비 디지털 문서를 참고하십시오.) AC-3 알고리즘(Arc Consistency Algorithm #3)은 (약어로 CSP)를 풀기 위한 일련의 알고리즘 중 하나이다. 1977년 가 고안하였다. 이전의 AC 알고리즘은 효율적(efficient)이지 않다고 여겨져 왔다. AC-3 이후의 것들은 구현하기 너무 복잡하다고 간주된다. 따라서 간단한 제약 만족 문제 해법으로서는 AC-3이 가장 많이 사용되는 알고리즘의 하나이다. (ko) Алгори́тм АС-3 (скор. Алгоритм Дуг Послідовності № 3) — це один із серії алгоритмів, які використовуються для розв'язання зада́ч викона́ння обме́жень (скор. CSP). Він був розроблений у 1977. Перші АС алгоритми вважалися неефективними, а інші, новіші, складними для використання. АС-3 алгоритм є одним із найбільш вживаних. Його часто використовують у дуже простих розв'язувачах задач. (uk)
dcterms:subject	Articles with example pseudocode Constraint programming
Wikipage page ID	1709424 (xsd:integer)
Wikipage revision ID	1121876957 (xsd:integer)
Link from a Wikipage to another Wikipage	Algorithm Relation (mathematics) Constraint (mathematics) Constraint satisfaction Constraint satisfaction problem Articles with example pseudocode Domain of a function Alan Mackworth Directed graph Constraint programming Big O notation Termination analysis Arc consistency Continuous and discrete variables
Link from a Wikipage to an external page	https://www.sciencedirect.com/science/article/abs/pii/0004370277900078
sameAs	AC-3 algorithm AC-3 algorithm AC-3 algorithm AC-3 algorithm AC-3 algorithm AC-3 algorithm AC-3 algorithm AC-3 algorithm
has abstract	In constraint satisfaction, the AC-3 algorithm (short for Arc Consistency Algorithm #3) is one of a series of algorithms used for the solution of constraint satisfaction problems (or CSP's). It was developed by Alan Mackworth in 1977. The earlier AC algorithms are often considered too inefficient, and many of the later ones are difficult to implement, and so AC-3 is the one most often taught and used in very simple constraint solvers. (en) Der AC-3-Algorithmus (von englisch arc consistency algorithm, dt.: Kantenkonsistenz-Algorithmus) ist ein Algorithmus zur Lösung von Constraint-Erfüllungsproblemen (CSPs) mit binären Bedingungen. Er wurde 1977 von entwickelt. (de) ( 이 문서는 제약 만족 문제에 관한 것입니다. AC-3 오디오 코덱에 대해서는 돌비 디지털 문서를 참고하십시오.) AC-3 알고리즘(Arc Consistency Algorithm #3)은 (약어로 CSP)를 풀기 위한 일련의 알고리즘 중 하나이다. 1977년 가 고안하였다. 이전의 AC 알고리즘은 효율적(efficient)이지 않다고 여겨져 왔다. AC-3 이후의 것들은 구현하기 너무 복잡하다고 간주된다. 따라서 간단한 제약 만족 문제 해법으로서는 AC-3이 가장 많이 사용되는 알고리즘의 하나이다. (ko) Алгори́тм АС-3 (скор. Алгоритм Дуг Послідовності № 3) — це один із серії алгоритмів, які використовуються для розв'язання зада́ч викона́ння обме́жень (скор. CSP). Він був розроблений у 1977. Перші АС алгоритми вважалися неефективними, а інші, новіші, складними для використання. АС-3 алгоритм є одним із найбільш вживаних. Його часто використовують у дуже простих розв'язувачах задач. (uk)
gold:hypernym	Series
prov:wasDerivedFrom	wikipedia-en:AC-3_algorithm?oldid=1121876957&ns=0
page length (characters) of wiki page	5115 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:AC-3_algorithm
is Link from a Wikipage to another Wikipage of	List of algorithms Constraint satisfaction problem Local consistency AC3
is foaf:primaryTopic of	wikipedia-en:AC-3_algorithm

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 49 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software