507 search results - page 78 / 102 » Automating first-order relational logic |
136
click to vote
CSL
2006
Springer
15 years 7 months ago
2006
Springer
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
122
click to vote
DLOG
2007
15 years 6 months ago
2007
In this paper we deal with the problem of providing natural language front-ends to databases upon which an ontology layer has been added. Specifically, we are interested in expres...
148
click to vote
LPNMR
1993
Springer
15 years 8 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
157
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
120
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
We present an efficient search strategy for satisfiability checking on circuits represented at the register-transfer-level (RTL). We use the RTL circuit structure by extending con...