1814 search results - page 104 / 363 » Extended First-Order Logic |
153
click to vote
CCIA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
205
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new binary sequ...
213
click to vote
LPAR
2007
Springer
16 years 11 days ago
2007
Springer
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
184
click to vote
STACS
2007
Springer
16 years 10 days ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
159
click to vote
TIME
2005
IEEE
15 years 11 months ago
2005
IEEE
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...