(redirected from Satisfiability)
Also found in: Dictionary, Thesaurus, Acronyms, Wikipedia.
Related to Satisfiability: Satisfiability problem, Conjunctive normal form
References in periodicals archive ?
addressed the satisfiability problem in the context of role-based workflow systems while supporting user delegation mechanisms [1].
In the theory of complexity, the problem of Satisfiability (SAT) of a Boolean formula plays a very significant theoretical and historical role.
Keywords: artificial intelligence, satisfiability problems, constraint satisfaction, boolean cardinality constraint, CNF encoding, AtMost-1 constraints
In this paper, we propose to construct context ontology first, so that we can determine what context information of service consumers will be matched against service information for service recommendation, and then we propose to formalize the precondition of successful service invocation based on a lightweight Description Language, and finally based on the formalization of both context of service consumers and precondition of service invocation, we can reason on context satisfiability for service recommendation in mobile network.
Program analysis via satisfiability modulo path programs, pp.
Satisfiability problems arise not only in complex chip design, but in many other areas such as packing a backpack with as many items as possible, or searching for the shortest postal route to deliver mail in a neighborhood.
One of the most surprising recent developments in satisfiability problems comes from statistical physics.
We do not impose general restrictions on the expressiveness of the ontology language; however, we require the availability of two decidable reasoning services: satisfiability of a conjunctive query, and containment test of two conjunctive queries, both w.
Working out a seating plan that would placate fractious dinner guests is a version of the logic puzzle in theoretical computer science known as the satisfiability (SAT) problem.
On the one hand, we plan to use complexity lower bound techniques as inspiration to design new and improved algorithms for Satisfiability and other NP-complete problems, as well as to analyze existing algorithms better.
The 12 topics they encompassed include mechanized game-based proofs of security protocols, interactive proof with applications to semantics, developments in probabilistic model checking, techniques and extensions of Boolean satisfiability solvers, separation logic and automatic program verification and analysis, and precise program analysis through strategy iteration and optimization.