58 search results - page 8 / 12 » Ordered Completion for First-Order Logic Programs on Finite ... |
264
Voted
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
171
Voted
SEMCO
2007
IEEE
16 years 19 days ago
2007
IEEE
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
166
Voted
AAAI
2010
15 years 7 months ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
162
Voted
ECAI
2000
Springer
15 years 10 months ago
2000
Springer
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
190
Voted
JOLLI
2008
15 years 6 months ago
2008
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...