@prefix dbpprop:	<http://dbpedia.org/property/> .
@prefix dbpedia:	<http://dbpedia.org/resource/> .
dbpedia:SMT_solver	dbpprop:redirect	dbpedia:Satisfiability_Modulo_Theories .
@prefix rdf:	<http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix ns3:	<http://dbpedia.org/class/yago/> .
dbpedia:Satisfiability_Modulo_Theories	rdf:type	ns3:NP-completeProblems ,
		ns3:SatisfiabilityProblems ,
		ns3:FormalMethods .
@prefix owl:	<http://www.w3.org/2002/07/owl#> .
dbpedia:Satisfiability_Modulo_Theories	owl:sameAs	<http://rdf.freebase.com/ns/guid.9202a8c04000641f8000000000c24159> .
@prefix foaf:	<http://xmlns.com/foaf/0.1/> .
@prefix ns6:	<http://en.wikipedia.org/wiki/> .
dbpedia:Satisfiability_Modulo_Theories	foaf:page	ns6:Satisfiability_Modulo_Theories ;
	dbpprop:reference	<http://people.csail.mit.edu/vganesh/Publications_files/vg2007-PhD-STANFORD.pdf> ,
		<http://mathsat4.disi.unitn.it/> ,
		<http://www.sigda.org> ,
		<http://www.eecs.berkeley.edu/~jha/beaver.html> ,
		<http://research.microsoft.com/projects/z3/> ,
		<http://www.smtcomp.org> ,
		<http://combination.cs.uiowa.edu/smtlib/> ,
		<http://yices.csl.sri.com/> .
@prefix ns7:	<http://sourceforge.net/projects/> .
dbpedia:Satisfiability_Modulo_Theories	dbpprop:reference	ns7:dpt ,
		<http://www.cs.nyu.edu/acsys/cvc3/> .
@prefix ns8:	<http://verify.inf.unisi.ch/> .
dbpedia:Satisfiability_Modulo_Theories	dbpprop:reference	ns8:opensmt ,
		<http://people.csail.mit.edu/vganesh/STP_files/stp.html> ,
		<http://www.decision-procedures.org:> ,
		<http://ergo.lri.fr/> ,
		<http://absolver.sourceforge.net/> ,
		<http://www.lsi.upc.edu/~oliveras/bclt-main.html> ,
		<http://vlsi.colorado.edu/~hhkim/sateen/> ,
		<http://www.cs.ubc.ca/~babic/index_spear.htm> ,
		<http://hysat.informatik.uni-oldenburg.de/> ,
		<http://fmv.jku.at/boolector/index.html> .
@prefix rdfs:	<http://www.w3.org/2000/01/rdf-schema#> .
dbpedia:Satisfiability_Modulo_Theories	rdfs:label	"Satisfiability Modulo Theories"@en ,
		"Satisfiability Modulo Theories (SMT)"@fr ;
	dbpprop:abstract	"Probl\u00E8me SMT (Satisfiability Modulo Theories) est un probl\u00E8me de la d\u00E9cision pour les formules logiques dans le respect d'une th\u00E9orie exprim\u00E9e dans la logique du premier ordre contenant l'\u00E9galit\u00E9. Des exemples de th\u00E9ories sont la th\u00E9orie des nombres r\u00E9els, la th\u00E9orie de entiers lin\u00E9aires, et des th\u00E9ories d'une vari\u00E9t\u00E9 de structures de donn\u00E9es comme les listes, les tableaux, les vecteurs de bits, etc."@fr ,
		"In computer science, Satisfiability Modulo Theories (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first-order logic with equality. Examples of theories typically used in computer science are the theory of real numbers, the theory of integers, and the theories of various data structures such as lists, arrays, bit vectors and so on."@en ;
	rdfs:comment	"Probl\u00E8me SMT (Satisfiability Modulo Theories) est un probl\u00E8me de la d\u00E9cision pour les formules logiques dans le respect d'une th\u00E9orie exprim\u00E9e dans la logique du premier ordre contenant l'\u00E9galit\u00E9. Des exemples de th\u00E9ories sont la th\u00E9orie des nombres r\u00E9els, la th\u00E9orie de entiers lin\u00E9aires, et des th\u00E9ories d'une vari\u00E9t\u00E9 de structures de donn\u00E9es comme les listes, les tableaux, les vecteurs de bits, etc."@fr ,
		"In computer science, Satisfiability Modulo Theories (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first-order logic with equality. Examples of theories typically used in computer science are the theory of real numbers, the theory of integers, and the theories of various data structures such as lists, arrays, bit vectors and so on."@en .
@prefix skos:	<http://www.w3.org/2004/02/skos/core#> .
@prefix ns11:	<http://dbpedia.org/resource/Category:> .
dbpedia:Satisfiability_Modulo_Theories	skos:subject	ns11:Electronic_design_automation ,
		ns11:Formal_methods ,
		ns11:Logic_in_computer_science ,
		ns11:NP-complete_problems ,
		ns11:Satisfiability_problems .
@prefix ns12:	<http://dbpedia.org/resource/Template:> .
dbpedia:Satisfiability_Modulo_Theories	dbpprop:wikiPageUsesTemplate	ns12:harv ;
	dbpprop:harvProperty	"Ratschan"@en ,
		"Bauer"@en ,
		"Herde"@en ,
		"Nieuwenhuis"@en ,
		"Schubert"@en ,
		"Tinelli"@en ,
		"Tautschnig"@en ,
		2006 ,
		"Fr\u00E4nzle"@en ,
		2007 ,
		"Oliveras"@en ,
		"Pister"@en .
@prefix ns13:	<http://dbpedia.org/resource/Satisfiability_Modulo_Theories/> .
dbpedia:Satisfiability_Modulo_Theories	dbpprop:relatedInstance	ns13:doi-inline2 ,
		ns13:doi-inline3 ,
		ns13:doi-inline1 .
@prefix ns14:	<http://www4.wiwiss.fu-berlin.de/flickrwrappr/photos/> .
dbpedia:Satisfiability_Modulo_Theories	dbpprop:hasPhotoCollection	ns14:Satisfiability_Modulo_Theories .
dbpedia:Satisfiability_modulo_theories	dbpprop:redirect	dbpedia:Satisfiability_Modulo_Theories .
dbpedia:Satisfiability_Modulo_Theories_problem	dbpprop:redirect	dbpedia:Satisfiability_Modulo_Theories .
@prefix yago:	<http://mpii.de/yago/resource/> .
yago:Satisfiability_Modulo_Theories	owl:sameAs	dbpedia:Satisfiability_Modulo_Theories .