Generic Literals

نویسنده

  • Florian Rabe
چکیده

Mmt is a formal framework that combines the flexibility of knowledge representation languages like OpenMath with the formal rigor of logical frameworks like LF. It systematically abstracts from theoretical and practical aspects of individual formal languages and tries to develop as many solutions as possible generically. In this work, we allow Mmt theories to declare user-defined literals, which makes literals as user-extensible as operators, axioms, and notations. This is particularly important for framework languages, which must be able to represent any choice of literals. Theoretically, our literals are introduced by importing a model that defines the denotations of some types and function symbols. Practically, Mmt is coupled with a programming language, in which these models are defined. Our results are implemented in the Mmt system. In particular, literals and computation on them are integrated with the parser and type checker.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Incremental Unit Propagation by Unifying Watched - literals and Local Repair

The propositional satisfiability problem has been studied extensively due to its theoretical significance and applicability to a variety of fields including diagnosis, autonomous control, circuit testing, and software verification. In these applications, satisfiability problem solvers are often used to solve a large number of problems that are essentially the same and only differ from each othe...

متن کامل

Splitting on Demand in SAT Modulo Theories

Lazy algorithms for Satisfiability Modulo Theories (SMT) combine a generic DPLL-based SAT engine with a theory solver for the given theory T that can decide the T -consistency of conjunctions of ground literals. For many theories of interest, theory solvers need to reason by performing internal case splits. Here we argue that it is more convenient to delegate these case splits to the DPLL engin...

متن کامل

On CNF Encodings of Decision Diagrams

Decisions diagrams such as Binary Decision Diagrams (BDDs), Multi-valued Decision Diagrams (MDDs) and Negation Normal Forms (NNFs) provide succinct ways of representing Boolean and other finite functions. Hence they provide a powerful tool for modelling complex constraints in discrete satisfaction and optimization problems. Generic propagators for these global constraints exist, but they are co...

متن کامل

A Fixed-Parameter Algorithm for Random Instances of Weighted d-CNF Satisfiability

We study random instances of the weighted d-CNF satisfiability problem (WEIGHTED dSAT), a generic W[1]-complete problem. A random instance of the problem consists of a fixed parameter k and a random d-CNF formula F k,d generated as follows: for each subset of d variables and with probability p, a clause over the d variables is selected uniformly at random from among the 2 − 1 clauses that conta...

متن کامل

Watching Clauses in Quantified Boolean Formulae

The introduction of watched literals[1], a lazy data structure for satisfiability (SAT) search algorithms, has resulted in great improvements in the run-time of SAT solvers. Watched literals keeps track of two literals remaining in a clause so as to detect when a clause becomes unit or empty. Watched literals is non-trivial to implement in QBF search. Quantified Boolean Formulae (QBFs) are SAT ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015