Gábor Kusper

Learn 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)
  • Gábor Kusper
  • Annals of Mathematics and Artificial Intelligence
  • 2005
We present a method, called Unicorn-SAT, based on submodel propagation, which solves the resolution-free SAT problem in linear time. A formula is resolution-free if there are no two clauses which differ only in one variable, i.e., each clause is blocked for each literal in it. A resolution-free formula is satisfiable or it contains the empty clause. For(More)
We describe the results of analyzing the performance model of a retrial queueing system with the probabilistic model checker PRISM. The system has been previously analyzed with the help of the performance modeling environment MOSEL; we are able to accurately reproduce the results reported in literature. Furthermore, we compare PRISM and MOSEL with respect(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 report our experience with formulating and analyzing in the probabilistic 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 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)
Our goal is to present a basic, novel, and correct SAT solver algorithm, show its soundness, compare it with a standard SAT solver, give some ideas in which cases might it be competitive. We do not present a fine-tuned, state-of-the-art SAT solver, only a new basic algorithm. So we introduce CCC, a SAT solver algorithm which is an iterative version of the(More)
We investigate based on a simple system model the range of applicability of the probabilistic model checker PRISM. In particular, we analyze the effect of the choice of the checking engine, of the numerical equation solver, and of other settings on the time and memory required for the analysis of the model by PRISM. The results demonstrate that not always(More)