Sciweavers

884 search results - page 129 / 177
» Using Nested Logic Programs for Answer Set Programming
Sort
View
CSL
2007
Springer
15 years 8 months ago
On the Complexity of Reasoning About Dynamic Policies
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
Stefan Göller
ICDAR
2009
IEEE
14 years 12 months ago
Unconstrained Handwritten Document Layout Extraction Using 2D Conditional Random Fields
The paper describes a new approach using a Conditional Random Fields (CRFs) to extract physical and logical layouts in unconstrained handwritten letters such as those sent by indi...
Florent Montreuil, Emmanuele Grosicki, Laurent Heu...
SIGCSE
2004
ACM
140views Education» more  SIGCSE 2004»
15 years 7 months ago
CFX: finding just the right examples for CS1
Finding just the right example to answer a question can be difficult for CS1 students and teachers. For this to work well there must be an intuitive interface coupled to an approp...
Dale Reed, Sam John, Ryan Aviles, Feihong Hsu
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 2 months ago
Enhanced Prolog Remote Predicate Call Protocol
Following the ideas of the Remote Procedure Call model, we have developed a logic programming counterpart, naturally called Prolog Remote Predicate Call (Prolog RPC) [1]. The Prol...
Alin Suciu, Kalman Pusztai, Andrei Diaconu
ENTCS
2008
120views more  ENTCS 2008»
15 years 2 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke