Complexity of the Satisfiability Problem for a Class of Propositional Schemata
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
LATA, 2010.

LATA 2010
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{LATA-2010-AravantinosCP,
	author        = "Vincent Aravantinos and Ricardo Caferra and Nicolas Peltier",
	booktitle     = "{Proceedings of the Fourth International Conference on Language and Automata Theory and Applications}",
	doi           = "10.1007/978-3-642-13089-2_5",
	isbn          = "978-3-642-13088-5",
	pages         = "58--69",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Complexity of the Satisfiability Problem for a Class of Propositional Schemata}",
	volume        = 6031,
	year          = 2010,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.