LOGCOM
2007
13 years 10 months ago
2007
In this paper we present s1, a family of logics that is useful to disprove propositional formulas by means of an anytime approximation process. The systems follows the paradigm of...
ECCC
2007
13 years 11 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
AML
2008
13 years 11 months ago
2008
A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional languag...
SPLC
2007
14 years 1 days ago
2007
Feature modeling is a notation and an approach for modeling commonality and variability in product families. In their basic form, feature models contain mandatory/optional feature...
ISSTA
2010
ACM
14 years 25 days ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Normative systems in a multiagent system must be able to evolve over time, for example due to actions creating or removing norms in the system. The only formal framework to evalua...
COLT
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. A brief overview is given of recent results on theory revision with queries for propositional formulas, such as monotone and unate DNF, Horn formulas, read-once formulas,...
TYPES
2007
Springer
14 years 5 months ago
2007
Springer
We consider propositional formulas built on implication. The size of a formula is the number of occurrences of variables in it. We assume that two formulas which differ only in th...