Algorithms for Maximum Satisfiability

... From 100 variables, 200 constraints (early 90s) up to >10,000,000 vars. and >50,000,000 clauses. in 20 years. Results of the SAT competition/race winners on the SAT 2009 application benchmarks, 20mn timeout ...

... From 100 variables, 200 constraints (early 90s) up to >10,000,000 vars. and >50,000,000 clauses. in 20 years. Results of the SAT competition/race winners on the SAT 2009 application benchmarks, 20mn timeout ...

Dynamic problem structure analysis as a basis for constraint

... the ODO scheduling framework, within which this work takes place. Also included in the section on the ODO framework are brief descriptions of the non-heuristic scheduling components (retraction techniques and propagators) used in our empirical studies. In Section 3 we present three heuristic commitm ...

... the ODO scheduling framework, within which this work takes place. Also included in the section on the ODO framework are brief descriptions of the non-heuristic scheduling components (retraction techniques and propagators) used in our empirical studies. In Section 3 we present three heuristic commitm ...

The Consistent Labeling Problem: Part I

... There are a variety of approaches to finding edges in a picture [22]. Most of them begin with the application of some local operator to determine the strength of an edge passing through each resolution cell in a particular direction. The problem with these local operators is that they tend to be noi ...

... There are a variety of approaches to finding edges in a picture [22]. Most of them begin with the application of some local operator to determine the strength of an edge passing through each resolution cell in a particular direction. The problem with these local operators is that they tend to be noi ...

Paper - FB3

... Description Logics (DLs) are an important family of logic-based knowledge representation formalisms [4]. In DL, one of the main research goals is to provide a toolbox of logics such that, for a given application, one can select a DL with adequate expressivity. Here, adequate means that, on the one h ...

... Description Logics (DLs) are an important family of logic-based knowledge representation formalisms [4]. In DL, one of the main research goals is to provide a toolbox of logics such that, for a given application, one can select a DL with adequate expressivity. Here, adequate means that, on the one h ...

Survey of Applications Integrating Constraint Satisfaction and Case

... these two observations hold true, it is worthwhile to solve new problems by reusing prior reasoning. The process by which a case-based reasoner operates has been described by Aamodt & Plaza [1] as a cyclical process comprised of the four REs: RETRIEVE the most similar case(s), REUSE the case(s) to s ...

... these two observations hold true, it is worthwhile to solve new problems by reusing prior reasoning. The process by which a case-based reasoner operates has been described by Aamodt & Plaza [1] as a cyclical process comprised of the four REs: RETRIEVE the most similar case(s), REUSE the case(s) to s ...

PDF

... good progress in the area of Automated Reasoning. For example, SATO (Satisﬁability Testing Optimized)[30], a model generator based on the Davis-PutnamLogemann-Loveland method for propositional clauses [7, 8], has solved a number of diﬃcult open existence problems for Quasigroups with speciﬁc algebr ...

... good progress in the area of Automated Reasoning. For example, SATO (Satisﬁability Testing Optimized)[30], a model generator based on the Davis-PutnamLogemann-Loveland method for propositional clauses [7, 8], has solved a number of diﬃcult open existence problems for Quasigroups with speciﬁc algebr ...

Lparse Programs Revisited: Semantics and Representation of

... In this paper, we study the semantics of lparse programs by investigating the relationship between it and the semantics proposed for logic programs with c-atoms. It turns out that the lparse semantics differs from all the other semantics. However, we show that for a large class of lparse programs, c ...

... In this paper, we study the semantics of lparse programs by investigating the relationship between it and the semantics proposed for logic programs with c-atoms. It turns out that the lparse semantics differs from all the other semantics. However, we show that for a large class of lparse programs, c ...

click here

... explain which type of problem is best suited for the CLP approach and where these problems occur in practice. They share a set of characteristics, which make them very hard to tackle with conventional problem solving methods. Combinatorial problems occur in many different application domains. We enc ...

... explain which type of problem is best suited for the CLP approach and where these problems occur in practice. They share a set of characteristics, which make them very hard to tackle with conventional problem solving methods. Combinatorial problems occur in many different application domains. We enc ...

Flexible Graphplan - Frontiers in Artificial Intelligence and

... satisfaction degrees and probabilities. For example, PGraphplan [4] produces a contingent plan that recommends repeated application of an operator in event of it not producing the desired effects on its first application. This is nonsense in the flexible context as repeating an action will not affec ...

... satisfaction degrees and probabilities. For example, PGraphplan [4] produces a contingent plan that recommends repeated application of an operator in event of it not producing the desired effects on its first application. This is nonsense in the flexible context as repeating an action will not affec ...

Dynamic domain splitting for numeric CSPs

... in subsection 3.4. An explanation is a set of splitting constraints. It is assumed in the rest of the paper that the initial csp (the one considered by the first call to addConstraint) is 2B-consistent and that each bound of the domains has ∅ as initial explanation. Thus, the explanation of a bound ...

... in subsection 3.4. An explanation is a set of splitting constraints. It is assumed in the rest of the paper that the initial csp (the one considered by the first call to addConstraint) is 2B-consistent and that each bound of the domains has ∅ as initial explanation. Thus, the explanation of a bound ...

LNCS 3258 - Full Dynamic Substitutability by SAT Encoding

... Full Dynamic Substitutability by SAT Encoding ...

... Full Dynamic Substitutability by SAT Encoding ...

Constraint-Based Knowledge Representation for Individualized

... precisely, they partition the universe of possible solutions into the correct and the incorrect ones. We need not assume a formal criterion or definition of correctness. Constraint-based modeling can be applied to any type of behavior. Constraints can represent aesthetic or moral judgments as well a ...

... precisely, they partition the universe of possible solutions into the correct and the incorrect ones. We need not assume a formal criterion or definition of correctness. Constraint-based modeling can be applied to any type of behavior. Constraints can represent aesthetic or moral judgments as well a ...

Reasoning about Topological and Positional Information in Dynamic Settings

... Qualitative reasoning problems are usually cast as constraint satisfaction problems (CSP), i. e., as the problem to determine whether a given finite set of constraints (a constraint network) is satisfiable or entailed by another constraint network. Here we focus on binary constraint satisfaction pro ...

... Qualitative reasoning problems are usually cast as constraint satisfaction problems (CSP), i. e., as the problem to determine whether a given finite set of constraints (a constraint network) is satisfiable or entailed by another constraint network. Here we focus on binary constraint satisfaction pro ...

Incremental temporal reasoning in job shop scheduling repair Please share

... the relative position of paired objects, and quantitative constraints place absolute bounds, or restrict the temporal distance between points [19]. A simple temporal network (STN) is defined as a collection of real-valued time point variables V corresponding to instantaneous events, admitting at mos ...

... the relative position of paired objects, and quantitative constraints place absolute bounds, or restrict the temporal distance between points [19]. A simple temporal network (STN) is defined as a collection of real-valued time point variables V corresponding to instantaneous events, admitting at mos ...

The Specification of Agent Behavior by Ordinary People: A Case Study

... This paper investigates these challenges via a case study that leverages our deployed system for semantic email agents (E-Agents).2 E-Agents provide a good testbed for examining the agent specification problem because they offer the potential for managing complex goals and yet are intended to be use ...

... This paper investigates these challenges via a case study that leverages our deployed system for semantic email agents (E-Agents).2 E-Agents provide a good testbed for examining the agent specification problem because they offer the potential for managing complex goals and yet are intended to be use ...

A Fast Arc Consistency Algorithm for n-ary Constraints Olivier Lhomme Jean-Charles R´egin

... the tuples in SC (x2 , a) are no longer valid, such as, for example, (a, a, a). The validity of the values supported by this tuple must be reconsidered; that is, the ones belonging to S((a, a, a)). Therefore, a new valid support for (x1 , a) must be searched for and so on... The program which aims t ...

... the tuples in SC (x2 , a) are no longer valid, such as, for example, (a, a, a). The validity of the values supported by this tuple must be reconsidered; that is, the ones belonging to S((a, a, a)). Therefore, a new valid support for (x1 , a) must be searched for and so on... The program which aims t ...

Full Dynamic Substitutability by SAT Encoding

... derived from the relationships between characters in works of literature. The search algorithm we use is Chaff [25], the first of the latest generation of fast SAT backtrackers. Chaff is deterministic and does not allow results to be averaged over multiple runs. However, it has been shown [10] that ...

... derived from the relationships between characters in works of literature. The search algorithm we use is Chaff [25], the first of the latest generation of fast SAT backtrackers. Chaff is deterministic and does not allow results to be averaged over multiple runs. However, it has been shown [10] that ...

Constraints and AI Planning

... it applies at all decision nodes a variety of branch selection, domain tightening, and simplification procedures to reduce the extent of the tree that must be searched. The first central component of refinement search is variable/ value selection techniques, which select a variable to which a specif ...

... it applies at all decision nodes a variety of branch selection, domain tightening, and simplification procedures to reduce the extent of the tree that must be searched. The first central component of refinement search is variable/ value selection techniques, which select a variable to which a specif ...

A Partial Taxonomy of Substitutability and Interchangeability

... this process is O(n2 d2 ), where n is the number of variables and d is the maximum domain size. Alternatively, one can build a refutation tree, which proceeds by splitting the domain of the variable [Likitvivatanavong and Yap, 2008]. The lower bound of the worst-case complexity of the refutation tre ...

... this process is O(n2 d2 ), where n is the number of variables and d is the maximum domain size. Alternatively, one can build a refutation tree, which proceeds by splitting the domain of the variable [Likitvivatanavong and Yap, 2008]. The lower bound of the worst-case complexity of the refutation tre ...

Simple Stochastic Temporal Constraint Networks

... X 1 ,..., X n , and a set of binary stochastic constraints, f ij (δ ) , imposed on the distances ∆ ij between some of these variables. As in the non-stochastic case, such a network can be represented by a directed constraint graph whose nodes correspond to variables and edges represent explicit cons ...

... X 1 ,..., X n , and a set of binary stochastic constraints, f ij (δ ) , imposed on the distances ∆ ij between some of these variables. As in the non-stochastic case, such a network can be represented by a directed constraint graph whose nodes correspond to variables and edges represent explicit cons ...

Exploiting Past and Future: Pruning by Inconsistent Partial State

... an unsatisfiable core by keeping track of all constraints involved in the proof of unsatisfiability [1]. Such constraints are the ones used during search to remove, through their propagators, at least one value in the domain of one variable. We adapt this “proof-based” approach to extract an unsatis ...

... an unsatisfiable core by keeping track of all constraints involved in the proof of unsatisfiability [1]. Such constraints are the ones used during search to remove, through their propagators, at least one value in the domain of one variable. We adapt this “proof-based” approach to extract an unsatis ...

Constraint Based Reasoning over Mutex Relations in Graphplan

... In other words, a valid plan can be extracted from the planning graph only if atoms of g are contained in some proposition layer Pj and there is no mutex between any two atoms from g at layer Pj. The Graphplan algorithm utilizes the result of the proposition for reduction of the search space that is ...

... In other words, a valid plan can be extracted from the planning graph only if atoms of g are contained in some proposition layer Pj and there is no mutex between any two atoms from g at layer Pj. The Graphplan algorithm utilizes the result of the proposition for reduction of the search space that is ...

and QUALITATIVE CONSTRAINTS - Dipartimento di Informatica

... Time has to be taken into account in each approach modeling (evolving) parts of the world ...

... Time has to be taken into account in each approach modeling (evolving) parts of the world ...

Fixed-parameter complexity in AI and nonmonotonic reasoning

... problem parameter is fixed or bounded by a fixed value. For example, consider the vertexcover problem. A vertex cover of a graph (V , E) is a set of vertices S ⊆ V such that, for each edge {u, v} ∈ E, at least one of u and v belongs to S. Deciding whether there is a vertex cover of size at most k, a ...

... problem parameter is fixed or bounded by a fixed value. For example, consider the vertexcover problem. A vertex cover of a graph (V , E) is a set of vertices S ⊆ V such that, for each edge {u, v} ∈ E, at least one of u and v belongs to S. Deciding whether there is a vertex cover of size at most k, a ...

Solving Distributed Constraint Optimization Problems Using Logic

... is a set of agents; and α : X → A maps each variable to one agent. A solution is a value assignment for all variables and its corresponding utility is the evaluation of all utility functions on such solution. The goal is to find a utility-maximal solution. A DCOP can be described by a constraint gra ...

... is a set of agents; and α : X → A maps each variable to one agent. A solution is a value assignment for all variables and its corresponding utility is the evaluation of all utility functions on such solution. The goal is to find a utility-maximal solution. A DCOP can be described by a constraint gra ...