2189 search results - page 280 / 438 » A Graded Applicability of Rules |
AMAI
2006
Springer
13 years 9 months ago
2006
Springer
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
ENGL
2008
13 years 9 months ago
2008
This paper presents an intelligent decision support system (DSS) for facilitating the adoption of the most appropriate multicriteria analysis (MA) method in solving the information...
ENTCS
2008
13 years 9 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
ENTCS
2008
13 years 9 months ago
2008
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
ENTCS
2008
13 years 9 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...