A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Solving First-Order Constraints in the Theory of the Evaluated Trees
[chapter]

2006
*
Lecture Notes in Computer Science
*

We describe

doi:10.1007/11799573_32
fatcat:bjoqncxfzjb5lbcqopceviluie
*in*this paper a general algorithm for*solving**first*-*order**constraints**in**the**theory*T*of**the**evaluated**trees*which is a combination*of**the**theory**of*finite or infinite*trees*and*the**theory*... It transforms a*first*-*order*formula ϕ, which can possibly contain free variables, into a disjunction φ*of**solved*formulas which is equivalent*in*T , without new free variables and such that φ is either ...*In*this paper we describe a general algorithm for*solving**first*-*order**constraints**in*T , i.e.*in*all models*of*T . ...##
###
Solving First-Order Constraints in the Theory of the Evaluated Trees
[chapter]

*
Lecture Notes in Computer Science
*

We describe

doi:10.1007/978-3-540-73817-6_7
dblp:conf/csclp/DaoD06
fatcat:anmgifcvcrhq7l76p5dgsgphge
*in*this paper a general algorithm for*solving**first*-*order**constraints**in**the**theory*T*of**the**evaluated**trees*which is a combination*of**the**theory**of*finite or infinite*trees*and*the**theory*... It transforms a*first*-*order*formula ϕ, which can possibly contain free variables, into a disjunction φ*of**solved*formulas which is equivalent*in*T , without new free variables and such that φ is either ...*In*this paper we describe a general algorithm for*solving**first*-*order**constraints**in*T , i.e.*in*all models*of*T . ...##
###
Solving Constrained Horn Clauses over ADTs by Finite Model Finding
[article]

2021
*
arXiv
*
pre-print

We have implemented our approach and

arXiv:2108.00225v2
fatcat:skd33ohnwfhkjdrfqt2f3wyczi
*evaluated*it against*the*state-*of*-art engines for*the*invariant inference*in**first*-*order*logic for ADT-manipulating programs. ... Subsequently, modern methods*in**the*automated inference*of*program invariants progress towards*the*construction*of**first*-*order*definable invariants. ... But ′ is unsatisfiable*in*a*first*-*order*sense since*the*query clause is derivable from*the**first*rule, which*solves*our problem. ...##
###
A decomposition approach for SMT-based schedule synthesis for time-triggered networks

2015
*
2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA)
*

This paper presents a decomposition approach that will allow us to improve to synthesize schedules with up to two

doi:10.1109/etfa.2015.7301436
dblp:conf/etfa/PozoSRH15
fatcat:oneugy56pnfdhmvenzyljsh54e
*orders**of*magnitude*in*terms*of**the*number*of**constraints*that can be handled. ... We also present an implementation*of*a dependency*tree*on top*of**the*decomposition approach to address applicationimposed*constraints*between frames. ... ACKNOWLEDGMENT*The*research leading to these results has received funding from*the*People Programme ( ...##
###
Experimental Evaluation of a State-Of-The-Art Grounder

2014
*
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming - PPDP '14
*

Many state-

doi:10.1145/2643135.2643149
dblp:conf/ppdp/JansenDDJ14
fatcat:3r74nnad2vgfrl2b5ulnqenzd4
*of*-*the*-art declarative systems use a ground-and-*solve*approach, where*the*problem statement, expressed*in*a high-level language, is*first*grounded into a low-level representation. ...*The**first*experiment discusses*the*impact*of**the*three techniques on*the*"efficiency"*of**the*grounding step, and on each other. ... A structure I satisfies a*theory*T if each sentence*in**the**theory**evaluates*to true under classical*first**order*semantics, and each inductive definition*in**the**theory*holds under*the*well-founded semantics ...##
###
Syntax-Guided Synthesis with Quantitative Syntactic Objectives
[chapter]

2018
*
Lecture Notes in Computer Science
*

Finally, we implement our algorithm

doi:10.1007/978-3-319-96145-3_21
fatcat:xtwcfzq2zfgq7f7od4546ymeui
*in*a tool, QuaSi, and*evaluate*it on 26 quantitative extensions*of*existing SyGuS benchmarks. ...*In*this paper, we propose QSyGuS, a unifying framework for describing syntaxguided synthesis problems with quantitative objectives over*the*syntax*of**the*synthesized programs. ...*The*authors were supported by National Science Foundation Grants CCF-1637516, CCF-1704117 and a Google Research Award. ...##
###
Progressive Reasoning over Recursively-Defined Strings
[chapter]

2016
*
Lecture Notes in Computer Science
*

Importantly, we have enabled conflict clause learning for string

doi:10.1007/978-3-319-41528-4_12
fatcat:rmb4kmka7vczjpa6273fypsdbu
*theory*so that our solver can be used effectively*in**the*setting*of*program verification. ... Finally, our experimental*evaluation*shows leadership*in*a large benchmark suite, and a*first*deployment for another benchmark suite which requires reasoning about string formulas*of*a class that has not ... Note that we control*the*branching*order**in*navigating*the*derivation*tree*by dictating*the**order**of**the*rules to be applied, as well as*the**order**in*which*the*reducts to be considered. ...##
###
Page 2050 of Mathematical Reviews Vol. , Issue 99c
[page]

1991
*
Mathematical Reviews
*

We

*solve**the*problem for queries with acyclic query graphs. We*first*count,*in*O(n) time,*the*exact number*of**trees*that can be used to*evaluate*a given query on n relations. ... “We study local properties*of*queries*in*a context that goes beyond*the*pure*first*-*order*case, and then apply*the*resulting tools to analyze*the*expressive power*of*SQL-like languages. ...##
###
Page 25 of Mathematical Reviews Vol. , Issue 99a
[page]

1991
*
Mathematical Reviews
*

*The*paper shows that

*the*combination

*of*regular

*tree*grammars and equational

*constraints*can be profitably used for building and representing Herbrand interpretations

*of*

*first*-

*order*formulae. ... G-formulae have a greater expressive power than equational formulae, and most problems about models can be

*solved*easily by using

*the*existing

*constraint*-

*solving*algorithms; examples are

*the*

*evaluation*...

##
###
Index—Volumes 1–89

1997
*
Artificial Intelligence
*

430

doi:10.1016/s0004-3702(97)80122-1
fatcat:6az7xycuifaerl7kmv7l3x6rpm
*of*stories 430*first*-*order*resolution logic theorem prover 17 terms 282,463 theorem-proving methods 314*first*-*order**theory*314, 1403*of**the*real numbers 470 fit between an agent and its environment ... -561 complexity*of*-1389 for specific surface markings 1275 framework, agent -1202 game*tree*-422 game*trees*56,75,674 game*trees*under a partial*order*1238*in*a game*tree*deeper -229*in*a*tree*... mathematics*of*non-monotonic-150 mechanism 381 mechanized formal -152 meta-level -185 method geometric -12 17 methods choices*of*-1157 models inexact -906 multiple inheritance -966 multiple lines*of*- ...##
###
Evaluating the impact of AND/OR search on 0-1 integer linear programming

2009
*
Constraints
*

We extend and

doi:10.1007/s10601-009-9070-7
pmid:21052484
pmcid:PMC2967791
fatcat:2xiev4juxvftvf23ojd3mzod3u
*evaluate**the*depth-*first*and best-*first*AND/OR search algorithms to*solving*0-1 Integer Linear Programs (0-1 ILP) within this framework. ... We also include a class*of*dynamic variable*ordering*heuristics while exploring an AND/OR search*tree*for 0-1 ILPs. ... Open Access This article is distributed under*the*terms*of**the*Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction*in*any medium, provided ...##
###
Constraint Solving on Terms
[chapter]

2001
*
Lecture Notes in Computer Science
*

Acknowledgments This document beneficiated

doi:10.1007/3-540-45406-3_2
fatcat:jup3wgnmznbi5fm73ygtgfbobe
*of*works and papers written with several colleagues,*in*particular Jean-Pierre Jouannaud, Hélène Kirchner and Christophe Ringeissen. ... When*solving*such*ordering**constraints*, a*first*main concern is about*the*introduction*of*new constants*in**order*to express*the*solutions. ... It follows*in*particular that*the**first*-*order**theory**of*encompassment predicates is decidable. ...##
###
An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking algorithms

2020
*
Open Computer Science
*

Numerous algorithms for

doi:10.1515/comp-2020-0149
fatcat:falfqmte7jgkncpv2sr6hmdrza
*solving**the*problem exist*in**the*literature and most*of*them are based on*the*backtracking approach. ... We perform an experimental*evaluation**of**the*techniques and their combinations and, hence, demonstrate their usefulness*in*practice. ... Acknowledgement: Our gratitude goes to Sven Cerk who performed most*of**the*experimental work several*of**the*refinements. ...##
###
Review of Service Restoration Methods in Distribution Networks

2018
*
2018 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe)
*

*The*used techniques consist

*of*expert systems, heuristic algorithms, meta-heuristic algorithms, graph

*theory*, multi-agent systems and mathematical programming. ... Service restoration (SR) is one

*of*

*the*most important strategies to improve

*the*resilience

*of*

*the*modern distribution network. ...

*The*

*first*stage uses piecewise linearization to transform

*the*MINLP problem into a MILP problem that is

*solved*

*in*

*order*to obtain

*the*binary decision variables (topology

*of*

*the*network). ...

##
###
Embedding the Virtual Substitution Method in the Model Constructing Satisfiability Calculus Framework

2017
*
International Symposium on Symbolic and Algebraic Computation
*

Satisfiability-modulo-

dblp:conf/issac/AbrahamNK17
fatcat:vwwlr4fmprb2jflgqegfiup2wu
*theories*(SMT )*solving*is a technique to check*the*satisfiability*of*logical formulas. ...*In**the*context*of*SMT*solving*, recently a novel technique called*the*model-constructing satisfiability calculus (MCSAT ) was introduced*in*[13, 9], with a nice embedding*of**the*cylindrical algebraic decomposition ... Problem Statement Satisfiability-modulo-*theories*(SMT )*solving*[1, 11] is a technique for checking*the*satisfiability*of*(usually quantifier-free)*first*-*order*logic formulas, i.e., Boolean combinations ...
« Previous

*Showing results 1 — 15 out of 131,743 results*