725 search results - page 22 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
150
Voted
AGP
2003
IEEE
15 years 7 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
109
click to vote
PPDP
2005
Springer
15 years 8 months ago
2005
Springer
Lolli is a logic programming language based on the asynchronous propositions of intuitionistic linear logic. It uses a backward chaining, backtracking operational semantics. In th...
111
click to vote
IJCAI
1997
15 years 3 months ago
1997
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
153
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
136
Voted
CIE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...