519 search results - page 21 / 104 » Comparing Instance Generation Methods for Automated Reasonin... |
CL
2000
Springer
15 years 5 months ago
2000
Springer
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
94
Voted
ICASSP
2010
IEEE
15 years 24 days ago
2010
IEEE
In commercial spoken dialog systems, call flows are built by call flow designers implementing a predefined business logic. While it may appear obvious from this logic how the c...
LPAR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...
AAAI
2000
15 years 1 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
DLOG
2007
15 years 2 months ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...