Results 1  10
of
111
Lazy Satisfiability Modulo Theories
 JOURNAL ON SATISFIABILITY, BOOLEAN MODELING AND COMPUTATION 3 (2007) 141Â224
, 2007
"... Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a firstorder formula with respect to some decidable firstorder theory T (SMT (T)). These problems are typically not handled adequately by standard automated theorem provers. SMT is being recognized as increasingl ..."
Abstract

Cited by 189 (50 self)
 Add to MetaCart
(Show Context)
Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a firstorder formula with respect to some decidable firstorder theory T (SMT (T)). These problems are typically not handled adequately by standard automated theorem provers. SMT is being recognized as increasingly important due to its applications in many domains in different communities, in particular in formal verification. An amount of papers with novel and very efficient techniques for SMT has been published in the last years, and some very efficient SMT tools are now available. Typical SMT (T) problems require testing the satisfiability of formulas which are Boolean combinations of atomic propositions and atomic expressions in T, so that heavy Boolean reasoning must be efficiently combined with expressive theoryspecific reasoning. The dominating approach to SMT (T), called lazy approach, is based on the integration of a SAT solver and of a decision procedure able to handle sets of atomic constraints in T (Tsolver), handling respectively the Boolean and the theoryspecific components of reasoning. Unfortunately, neither the problem of building an efficient SMT solver, nor even that
Adaptive Information Extraction: Core Technologies For Information Agents
, 2003
"... This paper gives a state of the art overview about machine learning approaches for information extraction from documents based on finite state techniques and relational learning methods related to inductive logic programming. ..."
Abstract

Cited by 56 (3 self)
 Add to MetaCart
This paper gives a state of the art overview about machine learning approaches for information extraction from documents based on finite state techniques and relational learning methods related to inductive logic programming.
Computing finite models by reduction to functionfree clause logic
 Journal of Applied Logic
, 2007
"... Recent years have seen considerable interest in procedures for computing finite models of firstorder logic specifications. One of the major paradigms, MACEstyle model building, is based on reducing model search to a sequence of propositional satisfiability problems and applying (efficient) SAT sol ..."
Abstract

Cited by 32 (9 self)
 Add to MetaCart
(Show Context)
Recent years have seen considerable interest in procedures for computing finite models of firstorder logic specifications. One of the major paradigms, MACEstyle model building, is based on reducing model search to a sequence of propositional satisfiability problems and applying (efficient) SAT solvers to them. A problem with this method is that it does not scale well because the propositional formulas to be considered may become very large. We propose instead to reduce model search to a sequence of satisfiability problems consisting of functionfree firstorder clause sets, and to apply (efficient) theorem provers capable of deciding such problems. The main appeal of this method is that firstorder clause sets grow more slowly than their propositional counterparts, thus allowing for more space efficient reasoning. In this paper we describe our proposed reduction in detail and discuss how it is integrated into the Darwin prover, our implementation of the Model Evolution calculus. The results are general, however, as our approach can be used in principle with any system that decides the satisfiability of functionfree firstorder clause sets. To demonstrate its practical feasibility, we tested our approach on all satisfiable problems from the TPTP library. Our methods can solve a significant subset of these problems, which overlaps but is not included in the subset of problems solvable by stateoftheart finite model builders such as Paradox and Mace4.
BottomUp Learning of Logic Programs for Information Extraction from Hypertext Documents
, 2003
"... ..."
Spark  A Generic Simulator for Physical Multiagent Simulations
, 2004
"... In this paper we describe a new multiagent simulation system, called Spark, for physical agents in threedimensional environments. Our goal in creating Spark was to provide a great amount of flexibility for creating new types of agents and simulations. To achieve this, we implemented a flexible app ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
In this paper we describe a new multiagent simulation system, called Spark, for physical agents in threedimensional environments. Our goal in creating Spark was to provide a great amount of flexibility for creating new types of agents and simulations. To achieve this, we implemented a flexible application framework and exhausted the idea of replaceable components in the resulting system. In comparison to specialized simulators, users can effortless create new simulations by using a scene description language. Spark is a powerful and flexible tool to state different multiagent research questions. It is used as official simulator for the first threedimensional RoboCup Simulation League competition. We present the concepts we used to achieve the flexibility in our system and show how we seamlessly integrated the different subsystems into one userfriendly framework.
Automatic Classification for the Identification of Relationships in a Metadata Repository
, 2003
"... ..."
Testing, abstraction, theorem proving: better together
 In Software Testing and Analysis (ISSTA
, 2006
"... We present a method for static program analysis that leverages tests and concrete program executions. State abstractions generalize the set of program states obtained from concrete executions. A theorem prover then checks that the generalized set of concrete states covers all potential executions an ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
(Show Context)
We present a method for static program analysis that leverages tests and concrete program executions. State abstractions generalize the set of program states obtained from concrete executions. A theorem prover then checks that the generalized set of concrete states covers all potential executions and satisfies additional safety properties. Our method finds the same potential errors as the mostprecise abstract interpreter for a given abstraction and is potentially more efficient. Additionally, it provides a new way to tune the performance of the analysis by alternating between concrete execution and theorem proving. We have implemented our technique in a prototype for checking properties of C # programs.
Taclets: A New Paradigm for Constructing Interactive Theorem Provers
 CIENCIAS EXACTAS, FÍSICAS Y NATURALES, SERIE A: MATEMÁTICAS, 98(1), 2004. SPECIAL ISSUE ON SYMBOLIC COMPUTATION IN LOGIC AND ARTIFICIAL INTELLIGENCE
, 2004
"... Frameworks for interactive theorem proving give the user explicit control over the construction of proofs based on meta languages that contain dedicated control structures for describing proof construction. Such languages are not easy to master and thus contribute to the already long list of skill ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
Frameworks for interactive theorem proving give the user explicit control over the construction of proofs based on meta languages that contain dedicated control structures for describing proof construction. Such languages are not easy to master and thus contribute to the already long list of skills required by prospective users of interactive theorem provers. Most users, however, only need a convenient formalism that allows to introduce new rules with minimal overhead. On the the other hand, rules of calculi have not only purely logical content, but contain restrictions on the expected context of rule applications and heuristic information. We suggest a new and minimalist concept for implementing interactive theorem provers called taclet. Their usage can be mastered in a matter of hours, and they are efficiently compiled into the GUI of a prover. We implemented the KeY system, an interactive theorem prover for the full JAVA CARD language based on taclets.