Search Sciweavers | Sciweavers

4513 search results - page 14 / 903

» Logic programming with satisfiability

click to vote

FOSSACS
2007
Springer

151views Software Engineering» more FOSSACS 2007»

The Complexity of Generalized Satisfiability for Linear Temporal Logic

13 years 11 months ago

Download www.cs.man.ac.uk

In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...

Michael Bauland, Thomas Schneider 0002, Henning Sc...

claim paper

Read More »

click to vote

IJCAI
2001

110views Artificial Intelligence» more IJCAI 2001»

Backjumping for Quantified Boolean Logic Satisfiability

13 years 8 months ago

Download www.csie.ntu.edu.tw

The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...

Enrico Giunchiglia, Massimo Narizzano, Armando Tac...

claim paper

Read More »

click to vote

LPAR
2010
Springer

215views Automated Reasoning» more LPAR 2010»

On the Satisfiability of Two-Variable Logic over Data Words

13 years 5 months ago

Download homepages.inf.ed.ac.uk

Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...

Claire David, Leonid Libkin, Tony Tan

claim paper

Read More »

click to vote

ISMVL
2008
IEEE

109views Hardware» more ISMVL 2008»

Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics

14 years 1 months ago