3773 search results - page 455 / 755 » Logical Reasoning |
167
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
172
click to vote
WEBI
2007
Springer
16 years 23 days ago
2007
Springer
The size of the Web and its increase rate made it cumbersome to locate high precision results to a requested piece of information. The Semantic Web provides a framework and a set ...
185
click to vote
FPGA
2009
ACM
16 years 1 months ago
2009
ACM
We describe an optimization method for combinational and sequential logic networks, with emphasis on scalability and the scope of optimization. The proposed resynthesis (a) is cap...
152
click to vote
LPNMR
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
187
click to vote
AAAI
1997
15 years 8 months ago
1997
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...