• Corpus ID: 18701348

Model Expansion as a Framework for Modelling and Solving Search Problems

@inproceedings{Mitchell2007ModelEA,
  title={Model Expansion as a Framework for Modelling and Solving Search Problems},
  author={David G. Mitchell and E. Ternovska},
  year={2007}
}
We propose a framework for modelling and solving search problems using logic, and describe a project whose goal is to produce practically effective, general purpose tools for representing and solving search problems based on this framework. The mathematical foundation lies in the areas of finite model theory and descriptive complexity, which provide us with many classical results, as well as powerful techniques, not available to many other approaches with similar goals. We describe the… 

Figures and Tables from this paper

A METHOD FOR SOLVING NP SEARCH BASED ON MODEL EXPANSION AND GROUNDING
TLDR
This work presents a method for solving NP search problems based on MX for first order logic extended with inductive definitions and cardinality constraints, and demonstrates the practical feasibility of the method with an implementation, called MXG.
Lazy Model Expansion: Interleaving Grounding with Search
TLDR
A theoretical framework and an implementation in the context of the FO(ċ) knowledge representation language for Lazily grounding the theory during search, where instead of grounding all parts of a theory, justifications are derived for some parts of it.
Lazy Model Expansion by Incremental Grounding
TLDR
A lazy approach to model expansion in the context of first-order logic that can cope with large and infinite problem domains and is hence more widely applicable than ground-and-solve.
Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic
TLDR
This paper presents a Knowledge Base project for FO(ID), an extension of classical logic with inductive definitions based on the view of a logic program as a definition and reports on inference systems that combine state-of-the-art techniques of SAT and ASP.
Model Expansion and the Expressiveness of FO ( ID ) and Other Logics
TLDR
The combined and data complexity of model expansion for FO(ID) (Denecker & Ternovska, 2008), as well as guarded and k-guarded logics of (Andréka, van Benthem, & Németi, 1998) and (Gottlob, Leone, & Scarcello, 2001).
Is computing science?
TLDR
An experimental comparison of the performance of MXG with Answer Set Programming (ASP) solvers on NP search problems based on Model Expansion (MX) is presented, showing that MXG is competitive and often better than previously reported declarative programming solutions using ASP solvers.
MXG : A Model Expansion Grounder and Solver
TLDR
MXG, a solver for NP search problems expressed as model expansion (MX), combines a high-level specification with an instance and produces a propositional formula encoding the solutions.
Arithmetic and Modularity in Declarative Languages for Knowledge Representation
TLDR
This thesis develops an ideal KR language that captures the complexity class NP for arithmetical search problems and guarantees universality and efficiency for solving such problems, and introduces a framework to language-independently combine modules from different KR languages.
Approximate Reasoning in First-Order Logic Theories
TLDR
This paper presents a method to compute from a given theory and finite domain an approximate structure: a structure that approximates all models, and shows confluence of this method and investigates its complexity.
The KB Paradigm and Its Application to Interactive Configuration
TLDR
It is shown that multiple functionalities in this domain can be achieved by applying different forms of logical inferences on a formal specification of the configuration domain, and reported on a proof of concept of this approach in a real-life application with a banking company.
...
1
2
3
...

References

SHOWING 1-10 OF 61 REFERENCES
A Framework for Representing and Solving NP Search Problems
TLDR
A declarative constraint programming framework is proposed which is based on the classical notion of extension of a structure by new relations, and properties of the formal framework intended to support effective modelling, and prospects for effective solver design.
Predicate-calculus-based logics for modeling and solving search problems
TLDR
This article proposes two logics based on predicate calculus as formalisms for encoding search problems and shows that the expressive power of these logics is given by the class NPMV.
Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions
TLDR
This paper proposes an efficient algorithm which combines grounding with partial evaluation in the case of k-guarded formulas with inductive definitions under a natural restriction, and performs much better than naive grounding by relying on connections between k-Guarded formulas and tree decompositions.
Constraint Programming with Unrestricted Quantification
TLDR
A recently proposed constraint programming framework, based on classical logic and the notion of expansion of a finite structure with new relations, supports unrestricted use of both first-order and second-order quantifiers, and discusses the roles of quantifiers.
Logic programs with stable model semantics as a constraint programming paradigm
  • I. Niemelä
  • Computer Science
    Annals of Mathematics and Artificial Intelligence
  • 2004
TLDR
It is shown that the novel paradigm embeds classical logical satisfiability and standard (finite domain) constraint satisfaction problems but seems to provide a more expressive framework from a knowledge representation point of view.
Complexity of Expanding a Finite Structure and Related Tasks
TLDR
The complexities of model expansion for a number of logics, alongside those of satisfiability and model checking, are presented, as the task is equivalent to witnessing the existential quantifiers in ∃SO model checking.
The IDP framework for declarative problem solving
TLDR
A typed version of the IDP-language is introduced, the use of the framework is illustrated through some prototypical examples and theoretical and methodological aspects are discussed.
Reducing Inductive Definitions to Propositional Satisfiability
TLDR
This paper defines a reduction from the propositional fragment of FO(ID) to SAT based on a novel characterization of two-valued well-founded models using a set of inequality constraints on level mappings associated with the atoms.
The DLV system for knowledge representation and reasoning
TLDR
The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration, and the main international projects investigating the potential of the system for industrial exploitation are described.
Declarative constraint modelling and specification-level reasoning
The CP paradigm has shown great advantages over “traditional” (i.e., imperative) programming: Problem specifications can be highly declarative, by describing the problem in terms of a search space
...
1
2
3
4
5
...