science.io - Logic in computer science

Topic: Logic in computer science

Sort: New & recommended · Active · Top Recommended · New

	3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General. (arXiv:1103.2165v2 [cs.CC] CROSS LISTED) By Timon Hertli 2 · 0 · from ArXiv:cs.DS · published 05/2011
	An algorithm for random signed 3-SAT with Intervals. (arXiv:1105.2525v1 [math.CO]) By Kathrin Ballerstein,Dirk Oliver Theis 1 · 0 · from ArXiv:cs.DS · published 05/2011
	Modal abstractions of concurrent behavior By Flemming Nielson, Sebastian Nanz, Hanne Riis Nielson 1 · 0 · from TOCL · published 05/2011
	Abstracting Abstract Machines: A Systematic Approach to Higher-Order Program Analysis. (arXiv:1105.1743v1 [cs.PL]) By David Van Horn,Matthew Might 1 · 0 · from ArXiv:cs.PL · published 05/2011
	Sound Bisimulations for Higher-Order Distributed Process Calculus. (arXiv:1006.4943v2 [cs.LO] UPDATED) By Adrien Piérard,Eijiro Sumii 1 · 0 · from ArXiv:cs.DC · published 05/2011
	Bisimulations for fuzzy automata. (arXiv:1102.5452v2 [cs.FL] UPDATED) By Miroslav Ćirić,Jelena Ignjatović,Nada Damljanović,Milan Bašić 1 · 0 · from ArXiv:cs.AI · published 05/2011
	A resource analysis of the pi-calculus. (arXiv:1105.0966v1 [cs.PL]) By Aaron Turon,Mitchell Wand 1 · 0 · from ArXiv:cs.DC · published 05/2011
	Transition Systems for Model Generators - A Unifying Approach. (arXiv:1105.0650v1 [cs.AI]) By Yuliya Lierler,Miroslaw Truszczynski 1 · 0 · from ArXiv:cs.AI · published 05/2011
	Limits of Preprocessing. (arXiv:1104.5566v1 [cs.AI]) By Stefan Szeider 1 · 0 · from ArXiv:cs.AI · published 05/2011
	Reducing Fuzzy Answer Set Programming to Model Finding in Fuzzy Logics. (arXiv:1104.5133v1 [cs.PL]) By Jeroen Janssen,Steven Schockaert,Dirk Vermeir,Martine De Cock 1 · 0 · from ArXiv:cs.PL · published 04/2011
	Boolean Equi-propagation for Optimized SAT Encoding. (arXiv:1104.4617v1 [cs.AI]) By Amit Metodi,Michael Codish,Vitaly Lagoon,Peter J. Stuckey 1 · 0 · from ArXiv:cs.AI · published 04/2011
	A Comparative Study of Software Model Checkers as Unit Testing Tools: An Industrial Case Study By Moonzoo Kim;Yunho Kim;Hotae Kim; 1 · 0 · from TSE
	Loupe: Verifying Publish-Subscribe Architectures with a Magnifying Lens By Baresi, L.;Ghezzi, C.;Mottola, L.; 1 · 0 · from TSE
	LTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees. (arXiv:1104.1159v2 [math.OC] UPDATED) By Xu Chu Ding,Stephen L. Smith,Calin Belta,Daniela Rus 1 · 0 · from ArXiv:cs.RO · published 04/2011
	Translating Pseudo-Boolean Constraints into CNF. (arXiv:1104.1479v1 [cs.LO]) By Amir Aavani 1 · 0 · from ArXiv:cs.DS · published 04/2011
	LTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees. (arXiv:1104.1159v1 [math.OC]) By Xu Chu Ding,Stephen L. Smith,Calin Belta,Daniela Rus 1 · 0 · from ArXiv:cs.RO · published 04/2011
	On rules with existential variables: Walking the decidability line☆ By 1 · 0 · from AIJ · published 03/2011
	Probabilistic Operational Semantics for the Lambda Calculus By Lago, Ugo Dal, Zorzi, Margherita 1 · 0 · from ArXiv-CS · published 04/2011
	Complexity Results for Modal Dependence Logic By Lohmann, Peter, Vollmer, Heribert 1 · 0 · from ArXiv-CS · published 04/2011
	Verified squared: does critical software deserve verified tools? By Xavier Leroy 3 · 0 · from POPL 2010 · published 01/2011
	On variables with few occurrences in conjunctive normal forms By Kullmann, Oliver, Zhao, Xishun 1 · 0 · from ArXiv-CS · published 10/2010
	Adversarial Satisfiability Problem By Castellana, Michele, Zdeborová, Lenka 1 · 0 · from ArXiv-CS · published 11/2010
	Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation By Deng, Yuxin, Du, Wenjie 1 · 0 · from ArXiv-CS · published 03/2011
	Model Checking CTL is Almost Always Inherently Sequential By Beyersdorff, Olaf, Meier, Arne, Mundhenk, Martin, Schneider, Thomas, Thomas, Michael, Vollmer, Heribert 1 · 0 · from ArXiv-CS · published 03/2011
	Algorithms for computing the greatest simulations and bisimulations between fuzzy automata By Ćirić, Miroslav, Ignjatović, Jelena, Jančić, Ivana, Damljanović, Nada 1 · 0 · from ArXiv-CS · published 03/2011
	A family of abstract interpretations for static analysis of concurrent higher-order programs By Might, Matt, Van Horn, David 1 · 0 · from ArXiv-CS · published 03/2011
	Modular Analysis via Specifications as Values By Tobin-Hochstadt, Sam, Van Horn, David 1 · 0 · from ArXiv-CS · published 03/2011
	3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General By Hertli, Timon 1 · 0 · from ArXiv-CS · published 03/2011
	Formal verification of a time-triggered hardware interface By Schmaltz, Julien 1 · 0 · from ArXiv-CS · published 03/2011
	Relating Sequent Calculi for Bi-intuitionistic Propositional Logic By Pinto, Luís, Uustalu, Tarmo 2 · 0 · from ArXiv-CS · published 01/2011

more ->

Topic Editors:

This topic is currently unedited. To recommend someone for editor or apply yourself email editors@science.io.