Gábor Kusper

Learn More
The SAT problem is the problem of finding a model for a formula in conjunctive normal form. We developed two algorithms based on hyper-unit propagation, which solve the SAT problem. Hyper-unit propagation is unit propagation simultaneously by literals, as unit clauses, of an assignment. The first method, called Unicorn-SAT algorithm, solves the(More)
The current trends in software engineering aim at narrowing the semantic and syntactic gap between the representation formalism of humans and of computers. This paper gives an overview on the application of natural language interface in software engineering applications and describes the structure of a NLI-based UML model developer module. An extended UML(More)
We report our experience with formulating and analyzing in the prob-abilistic model checker PRISM various closely related web server performance models that were previously described in literature in terms of classical queuing theory. By our work various ambiguities and deficiencies (also errors) are revealed; in particular, the PRISM models which combine(More)
We report a polynomial time SAT problem instance, the Blocked SAT problem. A blocked clause set, an instance of the Blocked SAT problem, contains only blocked clauses. A close is blocked (for resolution) if it has a literal on which no resolution is possible in the clause set. We know from work of O. Kullmann that a blocked clause can be added or deleted(More)
We describe a new formalism and special proof methods for a novel generalization of propositional logic, which is especially suitable for solving the satisfiability problem (SAT). A multi-domain logic (MDL) formula is quantifier-free and contains only atoms of the form x isin A, where x is a variable and A is a constant set. For formulae in conjunctive(More)
Ich erkläre an Eides statt, dass ich die vorliegende Dissertation selbstständig und ohne fremde Hilfe verfasst, andere als die angegebenen Quellen und Hilf-smittel nicht benutzt bzw. die wörtlich oder sinngemäß entnommenen Stellen als solche kenntlich gemacht habe. Abstract In this thesis we study the usage of sub-model propagation for solving SAT, the(More)