3470 search results - page 467 / 694 » Head-Elementary-Set-Free Logic Programs |
197
click to vote
ARGMAS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...
185
click to vote
TPHOL
1997
IEEE
15 years 10 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
267
Voted
PADL
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Boyer and Moore's ACL2 theorem prover combines firstorder applicative Common Lisp with a computational, first-order logic. While ACL2 has become popular and is being...
145
click to vote
FM
2009
Springer
16 years 25 days ago
2009
Springer
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
178
click to vote
LOPSTR
2009
Springer
16 years 24 days ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...