#### Filter Results:

#### Publication Year

2001

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Gábor Kusper
- 2002

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)

- Gábor Kusper
- 2002

We developed a method, called Unicorn-SAT, based on hyper-unit propagation, which solves the resolution-free SAT problem in linear time. Hyper-unit propagation is unit propagation simultaneous propagation of an assignment, considered as a set of unit clauses. A formula is resolution-free if and only if there are no two clauses which differ only in one… (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)

- Tamas BERCZES, Gabor GUTA, Gabor KUSPER, Wolfgang SCHREINER, Janos SZTRIK, Tamás Bérczes +4 others
- 2008

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)

- Gábor Kusper
- KI
- 2006

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 ∈ A, where x is a variable and A is a constant set. For formulae in con-junctive… (More)