725 search results - page 8 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
BMCBI
2011
13 years 2 months ago
2011
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
LATA
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
SIGCSE
2002
ACM
13 years 7 months ago
2002
ACM
This paper describes a tutorial program that serves a double role as an educational tool and a research environment. First, it introduces students to fundamental concepts of propo...
ICLP
2003
Springer
14 years 18 days ago
2003
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
ISMVL
1994
IEEE
13 years 11 months ago
1994
IEEE
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...