@prefix owl:	<http://www.w3.org/2002/07/owl#> .
@prefix dbpedia:	<http://dbpedia.org/resource/> .
dbpedia:Precondition	owl:sameAs	<http://rdf.freebase.com/ns/guid.9202a8c04000641f800000000004e23b> .
@prefix foaf:	<http://xmlns.com/foaf/0.1/> .
@prefix ns3:	<http://en.wikipedia.org/wiki/> .
dbpedia:Precondition	foaf:page	ns3:Precondition .
@prefix rdfs:	<http://www.w3.org/2000/01/rdf-schema#> .
dbpedia:Precondition	rdfs:label	"Precondici\u00F3n"@es ,
		"Vorbedingung (Informatik)"@de ,
		"\u041F\u0435\u0440\u0435\u0434\u0443\u043C\u043E\u0432\u0430 (\u0444\u043E\u0440\u043C\u0430\u043B\u044C\u043D\u0456 \u043C\u0435\u0442\u043E\u0434\u0438)"@uk ,
		"Precondition"@en .
@prefix dbpprop:	<http://dbpedia.org/property/> .
dbpedia:Precondition	dbpprop:abstract	"Die Vorbedingung einer Funktion oder eines Programms gibt an, unter welchen Bedingungen das Verhalten der Funktion definiert ist. Die Vorbedingung ist Teil der formalen Spezifikation der Funktion (bzw. des Programms) und dient der Verifikation: Wenn sie gilt, so m\u00FCssen nach Ausf\u00FChrung der Funktion alle Nachbedingungen erf\u00FCllt sein, sonst ist das Programm nicht korrekt. Das Konzept von Vor- und Nachbedingungen wird vor allem in der formalen Semantik benutzt: es stellt die Basis der axiomatischen Semantik dar. Das Ziel ist es dabei, aus den Vor- und Nachbedingungen der einzelnen Teile des Programms logisch die gew\u00FCnschte Nachbedingung f\u00FCr das gesamte Programm zu folgern."@de ,
		"In computer programming, a precondition is a condition or predicate that must always be true just prior to the execution of some section of code or before an operation in a formal specification. If a precondition is violated, the effect of the section of code becomes undefined and thus may or may not carry out its intended work. Security problems can arise due to incorrect preconditions. Often, preconditions are simply included in the documentation of the affected section of code. Preconditions are sometimes tested using assertions within the code itself, and some languages have specific syntactic constructions for doing so. For example: the factorial is only defined for integers greater than or equal to zero. So a program that calculates the factorial of an input number would have preconditions that the number be an integer and that it be greater than or equal to zero."@en ,
		"\u041F\u0435\u0440\u0435\u0434\u0443\u043C\u043E\u0301\u0432\u0430 \u2014 \u0432 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u0456 \u0442\u0430 \u0444\u043E\u0440\u043C\u0430\u043B\u044C\u043D\u0438\u0445 \u043C\u0435\u0442\u043E\u0434\u0430\u0445, \u043F\u0435\u0440\u0435\u0434\u0443\u043C\u043E\u0432\u043E\u044E \u0432\u0438\u043A\u043E\u043D\u0430\u043D\u043D\u044F \u0444\u0443\u043D\u043A\u0446\u0456\u0457 \u0454 \u043F\u0440\u0430\u0432\u0438\u043B\u043E, \u044F\u043A\u0435 \u0432\u0438\u0437\u043D\u0430\u0447\u0430\u0454, \u0437\u0430 \u044F\u043A\u0438\u0445 \u0443\u043C\u043E\u0432 \u0444\u0443\u043D\u043A\u0446\u0456\u044F \u043C\u0430\u0442\u0438\u043C\u0435 \u0432\u0438\u0437\u043D\u0430\u0447\u0435\u043D\u0443 \u043F\u043E\u0432\u0435\u0434\u0456\u043D\u043A\u0443. \u041F\u0435\u0440\u0435\u0434\u0443\u043C\u043E\u0432\u0430 \u0454 \u0447\u0430\u0441\u0442\u0438\u043D\u043E\u044E \u0444\u043E\u0440\u043C\u0430\u043B\u044C\u043D\u043E\u0457 \u0441\u043F\u0435\u0446\u0438\u0444\u0456\u043A\u0430\u0446\u0456\u0457 \u0456 \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u0454\u0442\u044C\u0441\u044F \u0434\u043B\u044F \u0432\u0435\u0440\u0438\u0444\u0456\u043A\u0430\u0446\u0456\u0457 \u043F\u0440\u043E\u0433\u0440\u0430\u043C: \u0432 \u0440\u0430\u0437\u0456 \u0432\u0438\u043A\u043E\u043D\u0430\u043D\u043D\u044F \u043F\u0435\u0440\u0435\u0434\u0443\u043C\u043E\u0432, \u043C\u0443\u0441\u044F\u0442\u044C, \u0432\u0456\u0434\u043F\u043E\u0432\u0456\u0434\u043D\u043E, \u0432\u0438\u043A\u043E\u043D\u0443\u0432\u0430\u0442\u0438\u0441\u044C \u0456 \u0432\u0441\u0456 \u043F\u0456\u0441\u043B\u044F\u0443\u043C\u043E\u0432\u0438, \u0432 \u0456\u043D\u0448\u043E\u043C\u0443 \u0432\u0438\u043F\u0430\u0434\u043A\u0443, \u0444\u0443\u043D\u043A\u0446\u0456\u044F \u043D\u0435 \u043A\u043E\u0440\u0435\u043A\u0442\u043D\u0430. \u041A\u043E\u043D\u0446\u0435\u043F\u0446\u0456\u044F \u043F\u0435\u0440\u0435\u0434- \u0442\u0430 \u043F\u0456\u0441\u043B\u044F \u0443\u043C\u043E\u0432 \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u0454\u0442\u044C\u0441\u044F \u0432 \u0444\u043E\u0440\u043C\u0430\u043B\u044C\u043D\u0456\u0439 \u0441\u0435\u043C\u0430\u043D\u0442\u0438\u0446\u0456 \u0434\u043B\u044F \u0441\u0442\u0432\u043E\u0440\u0435\u043D\u043D\u044F \u043E\u0441\u043D\u043E\u0432 \u0434\u043B\u044F \u0430\u043A\u0441\u0438\u043E\u043C\u0430\u0442\u0438\u0447\u043D\u043E\u0457 \u0441\u0435\u043C\u0430\u043D\u0442\u0438\u043A\u0438. \u041A\u0456\u043D\u0446\u0435\u0432\u043E\u044E \u043C\u0435\u0442\u043E\u044E \u0454 \u0434\u043E\u0432\u0435\u0434\u0435\u043D\u043D\u044F \u043F\u0440\u0430\u0432\u0438\u043B\u044C\u043D\u043E\u0441\u0442\u0456 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0438, \u0432\u0438\u0445\u043E\u0434\u044F\u0447\u0438 \u0456\u0437 \u0434\u043E\u0432\u0435\u0434\u0435\u043D\u043D\u044F \u043F\u0440\u0430\u0432\u0438\u043B\u044C\u043D\u043E\u0441\u0442\u0456 \u043A\u043E\u0436\u043D\u043E\u0457 \u043E\u043A\u0440\u0435\u043C\u043E\u0457 \u0444\u0443\u043D\u043A\u0446\u0456\u0457 \u0432\u0456\u0434\u043F\u043E\u0432\u0456\u0434\u043D\u043E \u0434\u043E \u0457\u0457 \u043F\u0435\u0440\u0435\u0434- \u0442\u0430 \u043F\u0456\u0441\u043B\u044F- \u0443\u043C\u043E\u0432."@uk ,
		"Una precondici\u00F3n es una condici\u00F3n que ha de satisfacerse justo antes del comienzo de la ejecuci\u00F3n de una porci\u00F3n de c\u00F3digo (normalmente un subprograma o m\u00E9todo). Por ejemplo: el factorial de un n\u00FAmero s\u00F3lo est\u00E1 definido para valores positivos (o cero). Por tanto, un subprograma que calcule el factorial de un n\u00FAmero exigir\u00E1 que dicho n\u00FAmero sea mayor o igual que cero. Existen lenguajes de programaci\u00F3n que incorporan construcciones sint\u00E1cticas para reflejar las precondiciones de sus subprogramas o m\u00E9todos. El c\u00E1lculo del factorial en el lenguaje Eiffel, por ejemplo, quedar\u00EDa as\u00ED: factorial: INTEGER -- Calcula el factorial de un n\u00FAmero. No est\u00E1 definido para cantidades negativas. require no_negativo: n &gt;= 0 do if n = 0 then Result := 1 else Result := n * factorial(n - 1) end end En donde la palabra require introduce la precondici\u00F3n del m\u00E9todo factorial."@es ;
	rdfs:comment	"\u041F\u0435\u0440\u0435\u0434\u0443\u043C\u043E\u0301\u0432\u0430 \u2014 \u0432 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u0456 \u0442\u0430 \u0444\u043E\u0440\u043C\u0430\u043B\u044C\u043D\u0438\u0445 \u043C\u0435\u0442\u043E\u0434\u0430\u0445, \u043F\u0435\u0440\u0435\u0434\u0443\u043C\u043E\u0432\u043E\u044E \u0432\u0438\u043A\u043E\u043D\u0430\u043D\u043D\u044F \u0444\u0443\u043D\u043A\u0446\u0456\u0457 \u0454 \u043F\u0440\u0430\u0432\u0438\u043B\u043E, \u044F\u043A\u0435 \u0432\u0438\u0437\u043D\u0430\u0447\u0430\u0454, \u0437\u0430 \u044F\u043A\u0438\u0445 \u0443\u043C\u043E\u0432 \u0444\u0443\u043D\u043A\u0446\u0456\u044F \u043C\u0430\u0442\u0438\u043C\u0435 \u0432\u0438\u0437\u043D\u0430\u0447\u0435\u043D\u0443 \u043F\u043E\u0432\u0435\u0434\u0456\u043D\u043A\u0443."@uk ,
		"Una precondici\u00F3n es una condici\u00F3n que ha de satisfacerse justo antes del comienzo de la ejecuci\u00F3n de una porci\u00F3n de c\u00F3digo (normalmente un subprograma o m\u00E9todo). Por ejemplo: el factorial de un n\u00FAmero s\u00F3lo est\u00E1 definido para valores positivos (o cero). Por tanto, un subprograma que calcule el factorial de un n\u00FAmero exigir\u00E1 que dicho n\u00FAmero sea mayor o igual que cero."@es ,
		"Die Vorbedingung einer Funktion oder eines Programms gibt an, unter welchen Bedingungen das Verhalten der Funktion definiert ist. Die Vorbedingung ist Teil der formalen Spezifikation der Funktion (bzw. des Programms) und dient der Verifikation: Wenn sie gilt, so m\u00FCssen nach Ausf\u00FChrung der Funktion alle Nachbedingungen erf\u00FCllt sein, sonst ist das Programm nicht korrekt."@de ,
		"In computer programming, a precondition is a condition or predicate that must always be true just prior to the execution of some section of code or before an operation in a formal specification. If a precondition is violated, the effect of the section of code becomes undefined and thus may or may not carry out its intended work. Security problems can arise due to incorrect preconditions. Often, preconditions are simply included in the documentation of the affected section of code."@en .
@prefix skos:	<http://www.w3.org/2004/02/skos/core#> .
@prefix ns7:	<http://dbpedia.org/resource/Category:> .
dbpedia:Precondition	skos:subject	ns7:Programming_constructs ,
		ns7:Formal_methods ,
		ns7:Logic_in_computer_science .
@prefix ns8:	<http://www4.wiwiss.fu-berlin.de/flickrwrappr/photos/> .
dbpedia:Precondition	dbpprop:hasPhotoCollection	ns8:Precondition .
dbpedia:Preconditionally	dbpprop:redirect	dbpedia:Precondition .
dbpedia:Preconditional	dbpprop:redirect	dbpedia:Precondition .
dbpedia:Preconditions	dbpprop:redirect	dbpedia:Precondition .
dbpedia:Pre-condition	dbpprop:redirect	dbpedia:Precondition .