Sciweavers

4513 search results - page 38 / 903
» Logic programming with satisfiability
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
14 years 10 months ago
On the Complexity of Elementary Modal Logics
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
Edith Hemaspaandra, Henning Schnoor
ALP
1994
Springer
15 years 2 months ago
A Logic for Variable Aliasing in Logic Programs
This paper introduces a logic for a class of properties - in particular variable aliasing - used in static analysis of logic programs. The logic is shown to be sound, complete and ...
Elena Marchiori
LPNMR
2004
Springer
15 years 3 months ago
nlp: A Compiler for Nested Logic Programming
nlp is a compiler for nested logic programming under answer set semantics. It is designed as a front-end translating nested logic programs into disjunctive ones, whose answer sets ...
Vladimir Sarsakov, Torsten Schaub, Hans Tompits, S...
ICTAI
1997
IEEE
15 years 1 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
AAAI
2006
14 years 11 months ago
Efficient Haplotype Inference with Boolean Satisfiability
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...
Inês Lynce, João Marques-Silva