746 search results - page 77 / 150 » Connectionist Propositional Logic |
135
Voted
LPNMR
2004
Springer
15 years 9 months ago
2004
Springer
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
126
click to vote
TIME
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time po...
158
Voted
IGPL
2006
15 years 3 months ago
2006
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
128
Voted
JAR
2002
15 years 3 months ago
2002
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
151
Voted
AAAI
2000
15 years 4 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...