Filters








64,986 Hits in 5.5 sec

Epistemology and artificial intelligence

Gregory R. Wheeler, Luís Moniz Pereira
2004 Journal of Applied Logic  
We illustrate this point by discussing how to represent a class of inference forms found in standard inferential statistics.  ...  Our modeling of standard inferential statistical arguments exploits results from both logical artificial intelligence and analytical epistemology.  ...  Logical Updates".  ... 
doi:10.1016/j.jal.2004.07.007 fatcat:kd3xnghcmvgitgd5u4j6zhxyce

Page 7271 of Mathematical Reviews Vol. , Issue 98K [page]

1998 Mathematical Reviews  
We are given m identical processors, s resources R,,---, Rs with upper bounds 4;,---,5,, and n independent jobs ; ,T, of unit length, where each job 7; has a start time r, © N and requires one processor  ...  programs with explicit negation; (2) a generic characterization schema useful for comparing various semantics of extended logic programs, including WFSX; (3) an auto-epistemic and a default logic corresponding  ... 

Page 6295 of Mathematical Reviews Vol. , Issue 2003h [page]

2003 Mathematical Reviews  
a resource bounded agent.  ...  The second type at least covers approaches like default logic.  ... 

Task types for pervasive atomicity

Aditya Kulkarni, Yu David Liu, Scott F. Smith
2010 Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '10  
¬} sharing-aware programming ¬ a static type system to enforce non-shared-memory-" is a logical thread preserving pervasive atomicity (created by sending a -> message to a "task object")The inversion  ...  wouldn't threads accessing "exclusive resources" end up waiting each other for a long time?  ... 
doi:10.1145/1869459.1869514 dblp:conf/oopsla/KulkarniLS10 fatcat:5jxpfwwfarbpxpjxayalevr6qa

Page 1411 of Mathematical Reviews Vol. , Issue 2004b [page]

2004 Mathematical Reviews  
resource logic for multi-agent plan merging.  ...  Furthermore, it can be used for a resource-bounded propagation scheme, in which the user determines in advance the maximal time available for the computation.  ... 

Page 1838 of Mathematical Reviews Vol. , Issue 98C [page]

1998 Mathematical Reviews  
Wiktor Marek, Jan Treur and Mirostaw Truszczynski, Infinitary default logic for specification of nonmonotonic reasoning (224-236); G. Anto- niou, A. P. Courtney, J. Ernst and M. A.  ...  ); Konstantinos Georgatos, Ordering-based representations of ratio- nal inference (176-191); Artur Mikitiuk, Semi-representability of default theories in rational default logic (192-207); Viorica Ciorba  ... 

Page 8665 of Mathematical Reviews Vol. , Issue 2003k [page]

2003 Mathematical Reviews  
programming, default logic, and autoepistemic logic.  ...  ., Amsterdam, 1993; per bibl.] a metaphor of a meta-level architecture was ex- ploited to define a nonmonotonic logic, called epistemic default logic.  ... 

Reasoning about beliefs and actions under computational resource constraints

1988 International Journal of Approximate Reasoning  
Although many i n vestigators a rm a desire to build reasoning systems that behave consistently with the axiomatic basis de ned by probability theory and utility theory, limited resources for engineering  ...  and computation can make a complete normative analysis impossible.  ...  Probabilistic bounding techniques determine bounds on probabilities through a logical analysis of constraints acquired from a partial analysis.  ... 
doi:10.1016/0888-613x(88)90148-x fatcat:scw47i5gyvazrcnznjh7ok6bym

Querying disjunctive databases through nonmonotonic logics

Piero A. Bonatti, Thomas Eiter
1996 Theoretical Computer Science  
Then we prove that under the assumption that the database consists of clauses whose length is bounded by some constant, default logic and autoepistemic logic express all of the Z,P-recognizable Boolean  ...  Secondly, we show that default logic, autoepistemic logic and some of their fragments express the same class of Boolean queries, which turns out to be a strict subclass of the Z,P-recognizable Boolean  ...  Acknowledgements The authors would like to thank Georg Gottlob for numerous discussions and his important suggestions, which had a strong influence on this work, Mirek Truszczytiski for his valuable hints  ... 
doi:10.1016/0304-3975(95)00192-1 fatcat:knpw5am77fbxtd557mlq64uxli

Grid Resource Abstraction, Virtualization, and Provisioning for Time-Targeted Applications

Yang-suk Kee, Carl Kesselman
2008 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID)  
This paper introduces a new HPDC resource management paradigm named resource slot which defines a network of logical machines across time and space.  ...  A resource slot is not only a resource programming target but also a virtualized resource provisioning framework for a variety of resource management paradigms by encapsulating the resource management  ...  Based on the applications' network requirements, the users can weave logical machines within a resource slot using a logical network.  ... 
doi:10.1109/ccgrid.2008.115 dblp:conf/ccgrid/KeeK08 fatcat:dh5t35xo3jfkzm5ef35imad3e4

Reasoning About Beliefs and Actions Under Computational Resource Constraints [article]

Eric J. Horvitz
2013 arXiv   pre-print
Although many investigators affirm a desire to build reasoning systems that behave consistently with the axiomatic basis defined by probability theory and utility theory, limited resources for engineering  ...  and computation can make a complete normative analysis impossible.  ...  Probabilistic bounding techniques determine bounds on probabilities through a logical analysis of constramts acquired from a partial analysis.  ... 
arXiv:1304.2759v1 fatcat:m27dxhoiszfrlcbcnjuet6tpki

QoS Aware Logical Channel Prioritization under Burst Resource Allocation for Uplink in LTE

Mannu Kumar, Neeti Kashyap
2017 International Journal of Information Technology and Computer Science  
The upper bound of bucket size for a logical channel L is equal to PBR × BSD. Fig. 6 shows the pictorial presentation of Logical Channel Prioritization.  ...  Each dedicate bearer is associated with a default bearer which we called as Linked EPS bearer and multiple dedicated bearers can be associated with the same default bearer.  ... 
doi:10.5815/ijitcs.2017.08.02 fatcat:csks4i3yr5dqhekxnbr3g2ggmi

Forthcoming Papers

2002 Artificial Intelligence  
In this paper we give a short introduction to logic programming approach to knowledge representation and reasoning.  ...  Lifschitz, Answer set programming and plan generation The idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and  ...  to models of bounded size.  ... 
doi:10.1016/s0004-3702(02)00216-3 fatcat:iqng4adjcbanxh46bjczyyedaa

Application of XenServer in Computer Laboratory

Fang Hu, Jun Deng
2019 OALib  
This paper explores the use of Citrix's XenServer system to virtualize the server, so as to solve the problem of insufficient server resources in teaching and scientific research.  ...  At present, the majority of servers are occupied by the school's core application system, and the server resources are insufficient to meet the needs of teachers for teaching and scientific research.  ...  A default value is automatically generated as the name of the iSCSI target (often referred to as "Target IQN"). 5) click Volumes-->iSCSI Target-->LUN Mapping to map iSCSI logical volume to iSCSI Target  ... 
doi:10.4236/oalib.1105357 fatcat:rwqrli3hyzgujc6wyoeygzva7q

Accelerating Large-Scale HPC Applications Using FPGAs

Rob Dimond, Sebastien Racanière, Oliver Pell
2011 2011 IEEE 20th Symposium on Computer Arithmetic  
Field Programmable Gate Arrays (FPGAs) are conventionally considered as 'glue-logic'.  ...  The flexibility of the FPGA to implement non-standard arithmetic, combined with a data-flow programming model that instantiates a separate unit for each arithmetic operator in the code provides a wide  ...  Conventionally, the FPGA is a logic emulation device used in telecommunications infrastructure and 'embedded' compute applications.  ... 
doi:10.1109/arith.2011.34 dblp:conf/arith/DimondRP10 fatcat:uzo3adoafvfejks2yhbhhdwjcu
« Previous Showing results 1 — 15 out of 64,986 results